YooccLa: a parser generator for L-attributed grammars
| Autor: | G. Butler, C. Mingins |
|---|---|
| Rok vydání: | 2022 |
| Předmět: |
Compiler-compiler
Computer science Programming language business.industry Other information and computing sciences not elsewhere classified Recursive descent parser computer.software_genre Top-down parsing Canonical LR parser Simple LR parser TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Parser combinator GLR parser Artificial intelligence Software_PROGRAMMINGLANGUAGES LALR parser business computer Natural language processing |
| Zdroj: | TOOLS (37) |
| DOI: | 10.26180/20707918 |
| Popis: | Argues that a parser generator can be developed that: (1) can bring parser technology within the reach of more software engineers, (2) requires less knowledge of parser technology than most existing parser generators, and (3) can allow a parser to be used where a designer might otherwise have chosen a fully procedural solution. A parser generator, called YooccLa (Yes! An Object-Oriented Compiler Compiler with left-attributes), has been developed to achieve these goals. It reads a non-left-recursive LL grammar specified in an EBNF-like language, augmented with Eiffel features specifying semantic actions. For each grammar production, YooccLa produces a pair of classes for the Eiffel Parse library: a syntax class specifying the syntax to Eiffel Parse, and a construct class specifying the semantics. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|