Fence - An Efficient Parser with Ambiguity Support for Model-Driven Language Specification

Model-based language specification has applications in the implementation of language processors, the design of domain-specific languages, model-driven software development, data integration, text mining, natural language processing, and corpus-based induction of models. Model-based language specification decouples language design from language processing and, unlike traditional grammar-driven approaches, which constrain language designers to specific kinds of grammars, it needs general parser generators able to deal with ambiguities. In this paper, we propose Fence, an efficient bottom-up parsing algorithm with lexical and syntactic ambiguity support that enables the use of model-based language specification in practice.

[1]  Alaa A. Kharbouch,et al.  Three models for the description of language , 1956, IRE Trans. Inf. Theory.

[2]  Daniel H. Younger,et al.  Recognition and Parsing of Context-Free Languages in Time n^3 , 1967, Inf. Control..

[3]  Daniel J. Rosenkrantz,et al.  Properties of deterministic top down grammars , 1969, STOC.

[4]  Alicia Ageno,et al.  Adaptive information extraction , 2006, CSUR.

[5]  Paul Hudak,et al.  Building domain-specific embedded languages , 1996, CSUR.

[6]  W. Taha,et al.  Plenary talk III Domain-specific languages , 2008, 2008 International Conference on Computer Engineering & Systems.

[7]  Alfred V. Aho,et al.  The Theory of Parsing, Translation, and Compiling , 1972 .

[8]  Douglas C. Schmidt,et al.  Model-Driven Engineering , 2006 .

[9]  Donald E. Knuth,et al.  On the Translation of Languages from Left to Right , 1965, Inf. Control..

[10]  M Mernik,et al.  When and how to develop domain-specific languages , 2005, CSUR.

[11]  Fernando Berzal Galiano,et al.  Lamb - A Lexical Analyzer with Ambiguity Support , 2011, ICSOFT.

[12]  Jerzy R. Nawrocki Conflict Detection and Resolution in a Lexical Analyzer Generator , 1991, Inf. Process. Lett..

[13]  Eelco Visser,et al.  Pure and declarative syntax definition: paradise lost and regained , 2010, OOPSLA.

[14]  Jay Earley,et al.  An efficient context-free parsing algorithm , 1970, Commun. ACM.

[15]  Aruna Raja,et al.  Domain Specific Languages , 2010 .

[16]  Valter Crescenzi,et al.  Automatic information extraction from large websites , 2004, JACM.

[17]  Martin Fowler,et al.  Domain-Specific Languages , 2010, The Addison-Wesley signature series.

[18]  James H. Martin,et al.  Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics, and Speech Recognition , 2000 .

[19]  Alfred V. Aho,et al.  Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

[20]  Anneke Kleppe,et al.  Towards the Generation of a Text-Based IDE from a Language Metamodel , 2007, ECMDA-FA.

[21]  Tadao Kasami,et al.  A Syntax-Analysis Procedure for Unambiguous Context-Free Grammars , 1969, J. ACM.