Stephen Robert Adams. Modular Grammars for Programming Language Prototyping. PhD thesis, University of Southampton, 1991.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....backtracking as modeled by the formal system. The formal TDPL work appears to have been largely neglected after its initial development, likely in part as a result of the excitement over the LR algorithms, which were newly developed at the time and probably were seen as more practical. Adams [1] recently used TDPL in a modular language prototyping framework. In addition, many practical top down parsing libraries and toolkits, including the popular ANTLR [17] and the Parsec combinator library for Haskell [14] provide similar limited backtracking capabilities which the parser designer can ....

Stephen Robert Adams. Modular Grammars for Programming Language Prototyping. PhD thesis, University of Southampton, 1991.

....statements in C like languages, and handling do, let, and lambda expressions in Haskell inherently involve longest match disambiguation. Packrat parsers are also more easily and naturally composable than LR parsers, making them a more suitable substrate for dynamic or extensible syntax [1]. Finally, both lexical and hierarchical analysis can be seamlessly integrated into a single unified packrat parser, and lexical and hierarchical language features can even be blended together, so as to handle string literals with embedded expressions or literate comments with structured document ....

....linear time GTDPL parsers through tabulation of results, but this linear time algorithm was apparently never put into practice, no doubt because main memories were much more limited at the time and compilers had to operate as streaming filters that could run in near constant space. Adams [1] recently resurrected GTDPL parsing as a component of a modular language prototyping framework, after recognizing its superior composability in comparison with LR algorithms. In addition, many practical top down parsing libraries and toolkits, including the popular ANTLR [15] and the PARSEC ....

Stephen Robert Adams. Modular Grammars for Programming Language Prototyping. PhD thesis, University of Southampton, 1991.

....or the transmission of tree structured 3 data. 3 The space profiles of monolithic recursions can often be modelled by bounded channels, but the device buffering and loose coupling exhibited by many channel networks makes it difficult to simulate their time profiles. Modular attribute grammars [DC90, FMY92, Ada91] specify tree decoration programs in a declarative, modular fashion. Modular attribute grammars allow different forms of tree processing to be interwoven. Although some versions limit number of traversals or space consumption, most approaches provide little control over these fundamental ....

Stephen Adams. Modular Grammars for Programming Language Prototyping. PhD thesis, Department of Electronics and Computer Science, University of Southampton, March 1991.

....for some programming languages. The style of adaptive grammar programming developed in the paper scales up to real grammar projects [11, 10] and it helps to actually make these projects feasible and predictable. The present paper does not explore several dimensions in depth. Modular grammars [1] and expressiveness beyond simple BNF as for example in SDF [7, 17] are not considered in the formalisation. Grammar transformations are useful for several applications not covered by this paper. In [19] grammar transformations are used for the development of domain specific languages starting ....

S. R. Adams. Modular Grammars for Programming Language Prototyping. PhD thesis, University of Southampton, Faculty of En- 17 gineering, Department of Electronics and Computer Science, Mar. 1991.

....useful and important. In contrast to macros, procedures offer sound type checking, and they are independent entities that can be stored, compiled and manipulated by a program. The benefits deriving from having aspects as explicit, first class entities in a programming language are the same. Adams [1] proposes a similar decomposition method, but lacks the type checking of aspects possible here. Ganzinger and Giegerich [8] also modularize attribute grammars but by decomposing the translation process into phases. This is a coarser decomposition 12 than our proposed method, which could be used ....

S. R. Adams. Modular Grammars for Programming Language Prototyping. PhD thesis, Department of Electronics and Computer Science, University of Southampton, UK, 1993.

....program will tend to use only a few at a time. Perhaps the central point of the first class approach is that interpreters can be constructed feature by feature, instead of monolithically. The importance of modularizing language specification and implementation is described in Stephen Adams thesis [Ada91]. Abstractly, any language has three parts: ffl a set of primitives ffl a means of combination ffl a means of abstraction. The primitives for our language building language will be parts of interpreters in the form of modules. 3.2 Modules This section describes why current module systems are ....

Stephen R. Adams. Modular Grammars for Programming Language Prototyping. PhD thesis, University of Southampton, March 1991.

No context found.

Stephen Robert Adams. Modular Grammars for Programming Language Prototyping. PhD thesis, University of Southampton, 1991.

No context found.

Stephen Robert Adams. Modular Grammars for Programming Language Prototyping. PhD thesis, University of Southampton, 1991.

No context found.

S. R. Adams. Modular Grammars for Programming Language Prototyping. PhD thesis, University of Southampton, Department of Electronics and Computer Science, UK, 1993.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC