Directory | Tags | Index | LinkIt | Submit   | Help
    Wednesday, 14 November 2018 - anonymous
Login/Register to vote and to have access to more features

You are here: Root > By Topic > Text Processing > Parser Generators

Pragmatic Parsing in Common Lisp
Created by holgerd on: Thu, 12 Oct 2006 10:40:26 GMT, Last modification: Thu, 12 Oct 2006 10:40:26 GMT

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.

Document location:


Henry Baker


Parser Generators | Code Snippets | English | Regular Expression

0 Notes and 0 comments

0 Notes

You must be logged to add a note


You must be logged to add a comment