Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
The C programming language
Journal of Logic Programming
The family of concurrent logic programming languages
ACM Computing Surveys (CSUR)
How to read floating point numbers accurately
PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
Equal rights for functional objects or, the more things change, the more they are the same
ACM SIGPLAN OOPS Messenger
Transition network grammars for natural language analysis
Communications of the ACM
The Definition of Standard ML
ACM SIGPLAN Notices - Special issue: History of programming languages conference
META II a syntax-oriented compiler writing language
ACM '64 Proceedings of the 1964 19th ACM national conference
META-3 syntax-directed compiler writing compiler to generate efficient code
ACM '64 Proceedings of the 1964 19th ACM national conference
Freeing the essence of a computation
ACM SIGPLAN Lisp Pointers
PEG-based transformer provides front-, middle-and back-end stages in a simple compiler
Workshop on Self-Sustaining Systems
Proceedings of the 4th ACM symposium on Haskell
| Hi-index | 0.00 |
We review META, a classic technique for building recursive descent parsers, that is both simple and efficient. While META does not handle all possible regular or context-free grammars, it handles a surprisingly large fraction of the grammars encountered by Lisp programmers. We show how META can be used to parse streams, strings and lists---including Common Lisp's hairy lambda expression parameter lists. Finally, we compare the execution time of this parsing method to the built-in methods of Common Lisp.