LALR: Difference between revisions
Jump to navigation
Jump to search
m (Gleki moved page jbocre: LALR to LALR without leaving a redirect: Text replace - "jbocre: L" to "L") |
m (Text replace - "jbocre: ([L-Z])" to "$1") |
||
| 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]]. | ||
Revision as of 15:04, 23 March 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.