Maptool – supporting modular syntax development

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1060, Issue , 1996, Pages 268-280

  Kadhim, Basim M ^a   Waite, William M ^a  

^a UNIVERSITY OF COLORADO   (United States)

Author keywords

Abstract syntax; Concrete syntax; Modularity; Parsing grammar; Syntax development; Syntax mapping; Tree construction

Indexed keywords

CONCRETES; FORESTRY; FORMAL LANGUAGES; MAPPING; PROGRAM COMPILERS; SEMANTICS; TREES (MATHEMATICS);

ABSTRACT SYNTAX; CONCRETE SYNTAX; MODULARITY; PARSING GRAMMAR; SYNTAX DEVELOPMENT; TREE CONSTRUCTION;

SYNTACTICS;

EID: 84957637535     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61053-7_67     Document Type: Conference Paper

References (12)

1. Alfred V. Aho and Stephen C. Johnson. Optimal code generation for expression trees. Journal of the ACM, 23(3):488–501, July 1976.
2. Ali Bahrami. CAGT – an automated approach to abstract and parsing grammars. Master’s thesis, Department of Electrical and Computer Engineering, University of Colorado, Boulder, CO, 1986.
3. Robert A. Ballance, Jacob Butcher, and Susan L. Graham. Grammatical abstraction and incremental syntax analysis in a language-based editor. In Proceedings of the SIGPLAN’88 Conference on Programming Language Design and Implementation, pages 185–198. SIGPLAN, ACM, June 1988.
4. Franklin L. DeRemer. Compiler Construction; An Advanced Course, chapter 2.E., pages 121–145. Springer-Verlag, New York, Heidelberg, Berlin, second edition, 1976.
5. Franklin L. DeRemer. Compiler Construction; An Advanced Course, chapter 2.A., pages 37–56. Springer-Verlag, New York, Heidelberg, Berlin, second edition, 1976.
6. Robert W. Gray, Vincent P. Heuring, Steve P. Levi, Anthony M. Sloane, and William M. Waite. Eli: A complete, flexible compiler construction system. Communications of the ACM, 35(2):121–131, February 1992.
7. U. Kastens and W. M. Waite. Modularity and reusability in attribute grammars. Acta Informatica, 31:601–627, 1994.
8. Uwe Kastens. LIGA: A language independent generator for attribute evaluators. Technical Report Reihe Informatik 63, Universität-GH Paderborn, Fachbereich Mathematik-Informatik, 1989.
9. Anton Nijholt. Context-Free Grammars: Covers, Normal Forms, and Parsing, volume 93 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, Heidelberg, New York, 1980.
10. Guido Persch, Georg Winterstein, Manfred Dausmann, and Sophia Drossopoulou. Overloading in preliminary Ada. SIGPLAN Notices, 15(11):47–56, November 1980.
11. D. J. Rosenkrantz and H. B. Hunt. Efficient algorithms for automatic construction and compactification of parsing grammars. Transactions on Programming Languages and Systems, 9(4):543–566, October 1987.
12. William M. Waite and Gerhard Goos. Compiler Construction. Texts and Monographs in Computer Science. Springer-Verlag, New York, Berlin, Heidelberg, Tokyo, 1984.