lALR: Difference between revisions
Jump to navigation
Jump to search
mNo edit summary |
|||
(2 intermediate revisions by one other user not shown) | |||
Line 1: | Line 1: | ||
A LALR(k) grammar represents a language which can be parsed by a [[ | A LALR(k) grammar represents a language which can be parsed by a [[LR|LR]] automaton with k-tokens of look ahead. LALR differs from [[LR|LR]] in the way in which the look-up tables are generated. | ||
See [[ | See [[Machine parsing|Machine parsing]]. |
Latest revision as of 08:19, 30 June 2014
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.