Fence - A Context-free Grammar Parser with Constraints for Model-driven Language Specification

Luis Quesada, Fernando Berzal, Francisco J. Cortijo

2012

Abstract

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.

References

  1. Aho, A. V., Lam, M. S., Sethi, R., and Ullman, J. D. (2006). Compilers: Principles, Techniques, and Tools. Addison Wesley, 2nd edition.
  2. Aho, A. V. and Ullman, J. D. (1972). The Theory of Parsing, Translation, and Compiling, Volume I: Parsing & Volume II: Compiling. Prentice Hall, Englewood Cliffs, N.J.
  3. Chomsky, N. (1956.). Three models for the description of language. IRE Transactions on Information Theory, 2:113-123.
  4. Crescenzi, V. and Mecca, G. (2004). Automatic information extraction from large websites. Journal of the ACM, 51:731-779.
  5. DeRemer, F. L. (1969). Practical translators for LR(k) languages. Technical report, Cambridge, MA, USA.
  6. DeRemer, F. L. (1971). Simple LR(k) grammars. Communications of the ACM, 14(7):453-460.
  7. DeRemer, F. L. and Pennello, T. (1982). Efficient computation of LALR(1) look-ahead sets. ACM Transactions on Programming Languages and Systems, 4(4):615- 649.
  8. Earley, J. (1983). An efficient context-free parsing algorithm. Communications of the ACM, 26:57-61.
  9. Fowler, M. (2010). Domain-Specific Languages. AddisonWesley.
  10. Hudak, P. (1996). Building domain-specific embedded languages. ACM Computing Surveys, vol. 28, no. 4es, art. 196.
  11. Kasami, T. and Torii, K. (1969). A syntax-analysis procedure for unambiguous context-free grammars. Journal of the ACM, 16:423-431.
  12. Klein, D. (2004). Christopher d. manning. In Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics (ACL 7804), pages 478-485.
  13. Knuth, D. E. (1965). On the translation of languages from left to right. Information and Control, 8:607-639.
  14. Lang, B. (1974). Deterministic techniques for efficient nondeterministic parsers. In Loeckx, J., editor, Automata, Languages and Programming, volume 14 of Lecture Notes in Computer Science, pages 255-269. Springer Berlin / Heidelberg.
  15. Mernik, M., Heering, J., and Sloane, A. M. (2005). When and how to develop domain-specific languages. ACM Computing Surveys, 37:316-344.
  16. Nawrocki, J. R. (1991). Conflict detection and resolution in a lexical analyzer generator. Information Processing Letters, 38:323-328.
  17. Oettinger, A. (1961). Automatic syntactic analysis and the pushdown store. In Proc. of the Symposia in Applied Math, volume 12, pages 104-129.
  18. Quesada, L., Berzal, F., and Cortijo, F. J. (2011a). Lamb - a lexical analyzer with ambiguity support. In Proceedings of the 6th International Conference on Software and Data Technologies, volume 1, pages 297-300.
  19. Quesada, L., Berzal, F., and Cortijo, F. J. (2011b). A tool for model-based language specification. ArXiv e-prints. http://arxiv.org/abs/1111.3970.
  20. Quesada, L., Berzal, F., and Cubero, J.-C. (2011c). A language specification tool for model-based parsing. In Proceedings of the 12th International Conference on Intelligent Data Engineering and Automated Learning. Lecture Notes in Computer Science, volume 6936, pages 50-57.
  21. Schmidt, D. C. (2006). Model-driven engineering. IEEE Computer, 39:25-31.
  22. Tan, P.-N., Steinbach, M., and Kumar, V. (2006). Introduction to Data Mining. Addison Wesley.
  23. Tomita, M. and Carbonell, J. G. (1987). The universal parser architecture for knowledge-based machine translation. In Proceedings of the 10th International Joint Conference on Artificial Intelligence, volume 2, pages 718-721.
  24. Turmo, J., Ageno, A., and Cataà, N. (2006). Adaptive information extraction. ACM Computing Surveys, vol. 38, no. 2, art. 4.
  25. Younger, D. H. (1967). Recognition and parsing of contextfree languages in time n3. Information and Control, 10:189-208.
Download


Paper Citation


in Harvard Style

Quesada L., Berzal F. and J. Cortijo F. (2012). Fence - A Context-free Grammar Parser with Constraints for Model-driven Language Specification . In Proceedings of the 7th International Conference on Software Paradigm Trends - Volume 1: ICSOFT, ISBN 978-989-8565-19-8, pages 5-13. DOI: 10.5220/0003949800050013


in Bibtex Style

@conference{icsoft12,
author={Luis Quesada and Fernando Berzal and Francisco J. Cortijo},
title={Fence - A Context-free Grammar Parser with Constraints for Model-driven Language Specification},
booktitle={Proceedings of the 7th International Conference on Software Paradigm Trends - Volume 1: ICSOFT,},
year={2012},
pages={5-13},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003949800050013},
isbn={978-989-8565-19-8},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 7th International Conference on Software Paradigm Trends - Volume 1: ICSOFT,
TI - Fence - A Context-free Grammar Parser with Constraints for Model-driven Language Specification
SN - 978-989-8565-19-8
AU - Quesada L.
AU - Berzal F.
AU - J. Cortijo F.
PY - 2012
SP - 5
EP - 13
DO - 10.5220/0003949800050013