History: LALR

Source of version: 1 (current)

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)).