Parsing reflective grammars

Authors:
Paul Stansifer;Mitchell Wand
Affiliations:
Northeastern University, Huntington Avenue Boston, Massachusetts;Northeastern University, Huntington Avenue Boston, Massachusetts
Venue:
Proceedings of the Eleventh Workshop on Language Descriptions, Tools and Applications
Year:
2011

Citing 11
Cited 1

A Faster Earley Parser

CC '96 Proceedings of the 6th International Conference on Compiler Construction
Directly-Executable Earley Parsing

CC '01 Proceedings of the 10th International Conference on Compiler Construction
Parsing expression grammars: a recognition-based syntactic foundation

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Extensible language implementation

Extensible language implementation
SPPF-Style Parsing From Earley Recognisers

Electronic Notes in Theoretical Computer Science (ENTCS)
Silver: an Extensible Attribute Grammar System

Electronic Notes in Theoretical Computer Science (ENTCS)
Verifiable composition of deterministic grammars

Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation
Gel: A Generic Extensible Language

DSL '09 Proceedings of the IFIP TC 2 Working Conference on Domain-Specific Languages
Semantics and algorithms for data-dependent grammars

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Efficient Earley Parsing with Regular Right-hand Sides

Electronic Notes in Theoretical Computer Science (ENTCS)
ABI compatibility through a customizable language

GPCE '10 Proceedings of the ninth international conference on Generative programming and component engineering

Adaptable parsing expression grammars

SBLP'12 Proceedings of the 16th Brazilian conference on Programming Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

Existing technology can parse arbitrary context-free grammars, but only a single, static grammar per input. In order to support more powerful syntax-extension systems, we propose reflective grammars, which can modify their own syntax during parsing. We demonstrate and prove the correctness of an algorithm for parsing reflective grammars. The algorithm is based on Earley's algorithm, and we prove that it performs asymptotically no worse than Earley's algorithm on ordinary context-free grammars.