Parsing Reflective Grammars

Details Parsing Reflective Grammars Parsing Reflective Grammars

2011-02-09

arxiv.org/abs/1102.2003v2

Computer Science

Programming Languages

A shorter version appears in LDTA 2011

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Parsing Reflective Grammars does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Parsing Reflective Grammars, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parsing Reflective Grammars will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-693827