lALR: Difference between revisions
Jump to navigation
Jump to search
m (Text replace - "jbocre: ([L-Z])" to "$1") |
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.