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.
C. Schulte. Universität des Saarlandes, Naturwissenschaftlich-Technische Fakultät I, Fachrichtung Informatik, Saarbrücken, Germany, Doctoral dissertation, (2000)
M. Milner. (1991)In this book we seek to explain in depth the meaning of a programming language. We present Standard ML by describing the objects in terms of which a programmer thinks when he is building a program, and how these objects work together; in
more formal ter.
B. Krishnamurthy (Ред.) John Wiley & Sons, New York, (1995)Notice: For personal use only. These materials
may not be reproduced or distributed in any form
or by any means except that they may be downloaded
from this source and printed for personal use..
A. Rose, B. Shneiderman, и C. Plaisant. ACM Proc. of DIS 95, Symposium on Designing Interactive Systems: Processes, Practices, Methods & Techniques, стр. 115-122. (августа 1995)