6533b860fe1ef96bd12c3829

RESEARCH PRODUCT

Testing Grammars for Parsability

Eljas Soisalon-soininenSeppo Sippu

subject

Discrete mathematicsClass (set theory)ParsingFinite-state machineGrammarComputer sciencemedia_common.quotation_subject16. Peace & justicecomputer.software_genreTuring machinesymbols.namesakeRule-based machine translationsymbolsRegular expressionLALR parsercomputermedia_common

description

In the preceding chapters we have studied in detail the major methods of deterministic context-free parsing: strong LL(k) parsing (Chapter 5), simple precedence parsing (Chapter 5), canonical LR(k) parsing, LALR(k) parsing, and SLR(k) parsing (Chapters 6 and 7), and canonical LL(k) parsing (Chapter 8). Each of these methods induces a class of grammars that are “parsable” using that method, that is, a class of grammars for which a deterministic parser employing that method can be constructed. For example, the LL(k) grammars constitute the class of grammars parsable by the LL(k) parsing method. By definition, a context-free grammar is an LL(k) grammar if and only if its canonical LL(k) parser is deterministic.

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