Optimization using LR(k) techniques

DeRemer, Franklin L.

doi:10.1145/987475.987479

Cited by 2 publications

(2 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Первый блок может быть реализован с помощью генерации различных типов распознавателей. В частности, существуют такие распознаватели, как LL [1], LR [2] и LALR [3], в том числе их обобщённые (generalized) модификации (GLL, GLR) [4], способные обрабатывать любые контекстно-свободные грамматики, толерантные модификации [5], предназначенные для распознавания определённых, интересных в рамках конкретных задач участков кода, а также "ленивые" модификации [6], которые позволяют исключить временные затраты на разбор неиспользуемых определений языка. Библиотека генерирует классические LR(1)-автоматы, поскольку они имеют большую распознавательную способность.…”

Section: анализ существующих решенийunclassified

Library for Development of Compilers

Mironov¹,

Batraeva²,

Dunaev³

2022

Proceedings of ISP RAS

View full text Add to dashboard Cite

This work is devoted to the development of a library designed to implement compilers. The article contains a description of the library's features and the main points of its functioning. In the course of the work, the generation of parsers using LR(1)-automata was studied and implemented, two auxiliary languages were designed and implemented: a semantic network query language and a language designed to generate executable code. The result of the work is a library for the platform .NET (the library was tested for the C# language), which contains classes that make easier the implementation of source code parsing, semantic analysis, and executable file generation. This library does not have external dependencies, except for the standard .NET library.

show abstract

Section: анализ существующих решенийunclassified

Library for Development of Compilers

Mironov¹,

Batraeva²,

Dunaev³

2022

Proceedings of ISP RAS

View full text Add to dashboard Cite

show abstract

“…(4. 19) para algum q em Q e algurri a em r 1 :}, onde nenhum movimen• to , ém ' ~* altera o A no t opo da pilha. L(i,A,t) i constituido, portanto, por todas as sentenças w qu~ levam M do estado q. a q l.…”

unclassified

Linguagens deterministicas

Terada¹

View full text Add to dashboard Cite

gort Setzer pela significativa orientação e estímulo que tornaram_ possível a realização deste trabalho. O autor também é grato ao colega Jorge Stolfi pela c~laboraç~o em programaçio, ao Departamento d~ Mate•itica Aplicada pelas facilidades oferecidas p~ ra •a realização desta dissertação, ao ~r. João Baptista Esteves de Oliveira pela excelente datilografia e ao sr. Armando Garcia Segura pelo esm~radooor viço de impressio.

show abstract

Optimization using LR(k) techniques

Cited by 2 publications

References 3 publications

Library for Development of Compilers

Library for Development of Compilers

Linguagens deterministicas

Contact Info

Product

Resources

About