An LR Parser with Less States
| Autor: | Hong Jun Tang |
|---|---|
| Rok vydání: | 2013 |
| Předmět: |
Theoretical computer science
Parsing Computer science LR parser Deterministic context-free grammar Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing) Operator-precedence grammar General Medicine Parsing expression grammar Recursive descent parser Top-down parsing computer.software_genre Canonical LR parser LL grammar Simple LR parser TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Deterministic finite automaton Parser combinator GLR parser LL parser Top-down parsing language LALR parser computer Algorithm Bottom-up parsing |
| Zdroj: | Applied Mechanics and Materials. 310:684-687 |
| ISSN: | 1662-7482 |
| DOI: | 10.4028/www.scientific.net/amm.310.684 |
| Popis: | This paper presents a new construction method of LR parser which is based on the theory of deterministic finite automata. The deterministic infinite automata are simplified for obtaining the LR parsing table with fewer states by merging the equivalent states. The new construction method has the same reorganization power as LALR parser but avoids the “reduce/reduce” conflict in LALR method. The experiment results show that the number of states in parsing table can be reduced greatly if the proposed method is used. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|