LALR: Difference between revisions
Jump to navigation
Jump to search
mNo edit summary |
mNo edit summary |
||
Line 1: | Line 1: | ||
A LALR(k) grammar represents a language which can be parsed by a [[jbocre: LR|LR]] automaton with k-tokens of look ahead. LALR differs from [[jbocre: LR|LR]] in the way in which the look-up tables are generated. | |||
See [[jbocre: Machine parsing|Machine parsing]]. | |||
Revision as of 16:57, 4 November 2013
A LALR(k) grammar represents a language which can be parsed by a LR automaton with k-tokens of look ahead. LALR differs from LR in the way in which the look-up tables are generated.
See Machine parsing.