Applying Classical Concepts to Parsing Expression Grammar

Authors:
Roman R. Redziejowski
Affiliations:
(Correspd.) Giraf's Research, Lidingö, Sweden. roman.redz@swipnet.se
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Year:
2009

Citing 5
Cited 2

Theory and Practice of Compiler Writing

Theory and Practice of Compiler Writing
Parsing expression grammars: a recognition-based syntactic foundation

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Compilers: Principles, Techniques, and Tools (2nd Edition)

Compilers: Principles, Techniques, and Tools (2nd Edition)
Parsing Expression Grammar as a Primitive Recursive-Descent Parser with Backtracking

Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Some Aspects of Parsing Expression Grammar

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)

Packrat parsers can handle practical grammars in mostly constant space

Proceedings of the 9th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
BITES Instead of FIRST for Parsing Expression Grammar

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper is an attempt to see how much we can learn about a given Parsing Expression Grammar with the help of classical concepts used in the construction of predictive top-down parsers.