Left recursion in Parsing Expression Grammars

Parsing Expression Grammars (PEGs) are a formalism that can describe all deterministic context-free languages through a set of rules that specify a top-down parser for some language. PEGs are easy to use, and there are efficient implementations of PEG libraries in several programming languages. A fr...

Full description

Bibliographic Details
Main Author: Medeiros, Sérgio Queiroz de (author)
Other Authors: Mascarenhas, Fabio (author), Ierusalimschy, Roberto (author)
Format: article
Language:eng
Published: 2020
Subjects:
Parsing Expression Grammars
Parsing
Left recursion
Parsing machine
Packrat parsing
Online Access:https://doi.org/MEDEIROS, Sérgio; MASCARENHAS, Fabio; IERUSALIMSCHY, Roberto. Left recursion in Parsing Expression Grammars. Science Of Computer Programming, [S.L.], v. 96, p. 177-190, dez. 2014. Disponível em: https://www.sciencedirect.com/science/article/pii/S0167642314000288?via%3Dihub. Acesso em: 06 out. 2020. http://dx.doi.org/10.1016/j.scico.2014.01.013.
https://doi.org/10.1016/j.scico.2014.01.013
Country:Brazil
Oai:oai:https://repositorio.ufrn.br:123456789/30876

Internet

https://doi.org/MEDEIROS, Sérgio; MASCARENHAS, Fabio; IERUSALIMSCHY, Roberto. Left recursion in Parsing Expression Grammars. Science Of Computer Programming, [S.L.], v. 96, p. 177-190, dez. 2014. Disponível em: https://www.sciencedirect.com/science/article/pii/S0167642314000288?via%3Dihub. Acesso em: 06 out. 2020. http://dx.doi.org/10.1016/j.scico.2014.01.013.
https://doi.org/10.1016/j.scico.2014.01.013

Similar Items