LALR: Difference between revisions
Jump to navigation
Jump to search
Latest revision as of 06:22, 13 July 2024
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.