History of LALR parser

	Revision 11 . . October 15, 2001 1:14 pm by AxelBoldt
	Revision 10 . . (edit) October 12, 2001 5:26 am by Dmerrill [fix typo in link to computer science]

---

Difference (from prior major revision) (no other diffs)

Changed: 3c3

The LALR algorithm produces LR parsers; they are used for recognizing strings from the language of a [context free grammar]?.

The LALR algorithm produces LR parsers; they are used for recognizing strings from the language of a context-free grammar.

Changed: 9c9

Yacc uses the Lookahead LR parser generator algorithm to produce parsers. It is commonly used in constructing programming language compilers.

The programms yacc and bison use the Lookahead LR parser generator algorithm to produce parsers. They are commonly used in constructing compilers for [programming languages]? and for writing other programs that expect input in a structured format that can be described by a context-free grammar.