Mauny, M. and D. de Rauglaudre. Parsers in ML. In ACM Symposium on Lisp and Functional Programming, pages 76-85, 1992.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....form larger modules. His e ort thus fails to address the core issues of component oriented programming [54] This work can exploit popular speci cation methods such as macros, templates and parser generators to simplify the description of compilers. There is a large corpus on such speci cations [1, 3, 8, 12, 10, 14, 15, 29, 35, 37, 39, 40, 51, 55, 60]. Many of these works ignore the interaction with components; indeed, many presume textual substitution on a per le basis in the tradition of cpp, paying no heed to modular boundaries. These systems do o er di erent combinations of pattern matching, hygienic macro expansion, and type systems to ....

Mauny, M. and D. de Rauglaudre. Parsers in ML. In ACM Symposium on Lisp and Functional Programming, pages 76-85, 1992.

....are not aware of work in the context of linguistic reflection to handle correctly the problematic binding situations sketched in subsection 3.3. Some non persistent language implementations, like CAML and SML, integrate YACC or a similar parser generator that allows them to introduce new syntax [MR92] If the new syntax is to be mixed with the old one, the new syntax must be quoted in some way. Instead, we can freely intermix new and old syntax without special quotations; it is also possible to remove existing keywords by redefining non terminals with the : operator. Hygienic macros ....

M. Mauny and D. Rauglaudre. Parsers in ML. In ACM Conference on Lisp and Functional Programming, 1992.

....are readable enough to act as a documentation. The extensibility of Chamau s syntax make it suitable for specialization to particular applications. 3 Parsing technology and efficiency considerations The parsers generated from grammars are mostly functional recursive descent parsers presented in [MdR92], with no backtrack. Parser generation from the grammars presented above does not use sophisticated algorithms. The different phases of parser generation are: 1. collection of new keywords, and update of the lexer associated to the grammar; 2. representation of the grammar as a tree data ....

Michel Mauny and Daniel de Rauglaudre. Parsers in ML. In Proceedings of the ACM International Conference on Lisp and Functional Programming, San Francisco, USA, 1992.

....summary of the constructs over streams and of primitives over streams is given in [20] An alternative to parsing with streams and stream matching are the camllex and camlyacc programs. A detailed presentation of streams and stream matching following predictive parsing semantics can be found in [25], where alternative semantics are given with some possible implementations. Exercises Exercise 10.1 Define a parser for the language of prefix arithmetic expressions generated by the grammar: Expr : INT Expr Expr Expr Expr Expr Expr Expr Expr Use the lexical analyzer ....

M. Mauny and D. de Rauglaudre. Parsers in ML. In Proceedings of the ACM Conference on Lisp and Functional Programming, 1992.

....summary of the constructs over streams and of primitives over streams is given in [20] An alternative to parsing with streams and stream matching are the camllex and camlyacc programs. A detailed presentation of streams and stream matching following predictive parsing semantics can be found in [25], where alternative semantics are given with some possible implementations. 76 CHAPTER 10. STREAMS AND PARSERS Exercises Exercise 10.1 Define a parser for the language of prefix arithmetic expressions generated by the grammar: Expr : INT Expr Expr Expr Expr Expr Expr ....

M. Mauny and D. de Rauglaudre. Parsers in ML. In Proceedings of the ACM Conference on Lisp and Functional Programming, 1992.

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