lALR

From Lojban
Revision as of 15:04, 23 March 2014 by Gleki (talk | contribs) (Text replace - "jbocre: ([L-Z])" to "$1")
Jump to navigation Jump to search

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.