6533b835fe1ef96bd129fde2

RESEARCH PRODUCT

LR(k) Parsing

Eljas Soisalon-soininenSeppo Sippu

subject

CombinatoricsClass (set theory)ParsingRule-based machine translationComputer scienceString (computer science)Acronym16. Peace & justicecomputer.software_genrecomputer

description

In this chapter we shall generalize the notion of strong LL(k) parsing presented in Chapter 5 and consider a method for deterministic left parsing that applies to a slightly wider class of context-free grammars than does the strong LL(k) parsing method. This method will be called “canonical LL(k) parsing”. As in strong LL(k) parsing, the acronym “LL(k)” means that the input string is parsed (1) in a single Left-to-right scan, (2) producing a Left parse, and (3) using lookahead of length k.

yearjournalcountryeditionlanguage
1990-01-01
https://doi.org/10.1007/978-3-662-08424-3_1