bookmarks (hide)2626
- journal publishing (PLoS)
- peg and leg are tools for generating recursive-descent parsers: programs that perform pattern matching on text. They processes a Parsing Expression Grammar (PEG) [Ford 2004] to produce a program that recognises legal sentences of that grammar. peg processes PEGs written using the original syntax described by Ford; leg processes PEGs written using slightly different syntax and conventions that are intended to make it an attractive replacement for parsers built with lex and yacc. Unlike lex and yacc, peg and leg support unlimited backtracking, provide ordered choice as a means for disambiguation, and can combine scanning (lexical analysis) and parsing (syntactic analysis) into a single activity.
publications (hide)76
- ACM Proc. of DIS 95, Symposium on Designing Interactive Systems: Processes, Practices, Methods & Techniques, page 115-122. (August 1995)
- (2002)
- HCI, (2001)
- CHI, (2001)
- (2000)
- Prentice Hall International Series in Computer Science, 2nd edition, (1992)Free online.
- International Thomson Computer Press, (1996)FREE PDF online.
- Prentice Hall, (1992)Free online version.
- (2000)
- (December 2003)Online (html) version of the book avail at the URL.
- Ellis Horwood, Chichester, England, (1990)PDF online free.
- MIT Press, (1992-2001)
- (2002)
- Oxford: Oxbow Books., (2005)
- Policy Research Division Working Paper, (2003)
- Technical Report, 91-1. Department of Computer Science, University of Queensland, St.\ Lucia 4072, Australia, (April 1991)
