Practical LR Parser Generation

Autor: Zimmerman, Joe

Parsing is a fundamental building block in modern compilers, and for industrial programming languages, it is a surprisingly involved task. There are known approaches to generate parsers automatically, but the prevailing consensus is that automatic pa

Externí odkaz: http://arxiv.org/abs/2209.08383

Developing and Evaluating a Probabilistic LR Parser of Part-of-Speech and Punctuation Labels

Autor: Briscoe, Ted, Carroll, John

Publikováno v: 4th International Workshop on Parsing Technologies (IWPT-95), 48-58

We describe an approach to robust domain-independent syntactic parsing of unrestricted naturally-occurring (English) input. The technique involves parsing sequences of part-of-speech and punctuation labels using a unification-based grammar coupled wi

Externí odkaz: http://arxiv.org/abs/cmp-lg/9510005

A Simple, Possibly Correct LR Parser for C11

Autor: Jacques-Henri Jourdan, François Pottier

Publikováno v: ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS), ACM, 2017, 39 (4), pp.1-36. ⟨10.1145/3064848⟩
ACM Transactions on Programming Languages and Systems (TOPLAS), 2017, 39 (4), pp.1-36. ⟨10.1145/3064848⟩

International audience; The syntax of the C programming language is described in the C11 standard by an ambiguous context-free grammar, accompanied with English prose that describes the concept of " scope " and indicates how certain ambiguous code fr

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::33a46063777587db07c9fd0a434b2a26
https://doi.org/10.1145/3064848

State Merging in LR Parser under Count based Reduction

Autor: Pawan Kumar, R. D. SolomonRaju

Publikováno v: International Journal of Computer Applications. 100:19-31

An LR parser shows error only during scanning input symbol. Error is never shown during the reduction of a handle (substring of stack) into nonterminal. It is because a symbol is put into the stack only when it is guaranteed to be the correct one. If

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::0c212aae80a5d0caeaa6b84fe98c1851
https://doi.org/10.5120/17616-8235

LL conflict resolution using the embedded left LR parser

Autor: Boštjan Slivnik

Publikováno v: Computer Science and Information Systems. 9:1105-1124

A method for resolving LL(k) conflicts using small LR(k) parsers (called embedded left LR(k) parsers) is described. An embedded left LR(k) parser is capable of (a) producing the prefix of the left parse of the input string and (b) stopping not on the

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::8763a9c29bd88f594074d5cc6baabb15
https://doi.org/10.2298/csis111216023s