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...
Guardat en:
| Autors principals: | , , |
|---|---|
| Format: | article |
| Idioma: | English |
| Publicat: |
Elsevier
|
| Matèries: | |
| Accés en línia: | https://repositorio.ufrn.br/handle/123456789/30876 |
| Etiquetes: |
Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|