A Constraint-Satisfaction Parser for Context-Free Grammars

Details A Constraint-Satisfaction Parser for Context-Free Grammars A Constraint-Satisfaction Parser for Context-Free Grammars

2011-10-07

arxiv.org/abs/1110.1470v3

Computer Science

Computation and Language

Scientific paper

Traditional language processing tools constrain language designers to specific kinds of grammars. In contrast, model-based language specification decouples language design from language processing. As a consequence, model-based language specification tools need general parsers able to parse unrestricted context-free grammars. As languages specified following this approach may be ambiguous, parsers must deal with ambiguities. Model-based language specification also allows the definition of associativity, precedence, and custom constraints. Therefore parsers generated by model-driven language specification tools need to enforce constraints. In this paper, we propose Fence, an efficient bottom-up chart parser with lexical and syntactic ambiguity support that allows the specification of constraints and, therefore, enables the use of model-based language specification in practice.

Affiliated with

Also associated with

No associations

Rating

A Constraint-Satisfaction Parser for Context-Free 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 A Constraint-Satisfaction Parser for Context-Free Grammars, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Constraint-Satisfaction Parser for Context-Free Grammars will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-132714