Acta Univ. Agric. Silvic. Mendelianae Brun. 2011, 59(7), 137-146 | DOI: 10.11118/actaun201159070137

Design of methodology for incremental compiler construction

Pavel Haluza, Jiří Rybička
Ústav informatiky, Mendelova univerzita v Brně, Zemědělská 1, 613 00 Brno, Česká republika

The paper deals with possibilities of the incremental compiler construction. It represents the compiler construction possibilities for languages with a fixed set of lexical units and for languages with a variable set of lexical units, too. The methodology design for the incremental compiler construction is based on the known algorithms for standard compiler construction and derived for both groups of languages. Under the group of languages with a fixed set of lexical units there belong languages, where each lexical unit has its constant meaning, e.g., common programming languages. For this group of languages the paper tries to solve the problem of the incremental semantic analysis, which is based on incremental parsing. In the group of languages with a variable set of lexical units (e.g., professional typographic system TEX), it is possible to change arbitrarily the meaning of each character on the input file at any time during processing. The change takes effect immediately and its validity can be somehow limited or is given by the end of the input. For this group of languages this paper tries to solve the problem case when we use macros temporarily changing the category of arbitrary characters.

Keywords: parser, incremental analysis, compiler, programming language, TEX

Received: August 31, 2011; Published: January 26, 2014  Show citation

ACS AIP APA ASA Harvard Chicago IEEE ISO690 MLA NLM Turabian Vancouver
Haluza, P., & Rybička, J. (2011). Design of methodology for incremental compiler construction. Acta Universitatis Agriculturae et Silviculturae Mendelianae Brunensis, 59(7), 137-146. doi: 10.11118/actaun201159070137
Share...
Download citation
  • BibTeX (.bib)
  • Bookends (.ris)
  • EasyBib (.ris)
  • EndNote (.enw)
  • EndNote 8 (.xml)
  • ISI WoS (.isi)
  • Medlars (.medlars)
  • Mendeley (.ris)
  • MODS (.xml)
  • Papers (.ris)
  • RefWorks (.txt)
  • RefManager (.ris)
  • RIS (.ris)
  • MS Word (.xml)
  • Zotero (.ris)
    • Open full article

    References

    1. AGRAWAL, R., DETRO, K. D., 1983: An Efficient Incremental LR Parser for Grammars with Epsilon Productions. Acta Inf., 19, pp. 369-376. DOI: 10.1007/BF00290733 Go to original source...
    2. ALONSO, M. A., CABRERO, D., VILARES, M., 1997: A New Approach to the Construction of Generalized LR Parsing Algorithms.
    3. FERRO, M. V., DION, B. A., 1994: Efficient Incremental Parsing for Context-Free Languages. Proceedings of the 5th IEEE International Conference on Computer Languages, pp. 241-252.
    4. HOPCROFT, J. E., ULLMAN, J. D., 1978: Formalne jazyky a automaty. Bratislava: Alfa, 343 pp.
    5. HORSPOOL, R. N., 1990: Incremental Generation of LR Parsers. Computer Languages, Vol. 15, issue 4, pp. 205-223. ISSN 0096-0551. DOI: 10.1016/0096-0551(90)90021-G Go to original source...
    6. LI, W. X., 1995: A Simple and Efficient Incremental LL(1) Parsing. Lecture Notes in Computer Science, Vol. 1012. ISBN 987-3-540-60609-3.
    7. LI, W. X., 1996: Building Efficient LL Incremental Parsers by Augmenting LL Tables and Threading Parse Trees. Computer Languages, Vol. 22, No. 4, pp. 225-235. DOI: 10.1016/S0096-0551(96)00015-X Go to original source...
    8. MATOUŠEK, M., 2001: Transformace strukturně značkovaných dokumentů. Diplomová práce. Brno: MZLU v Brně. 76 pp.
    9. MEDUNA, A., 2000: Automata and Languages: Theory and Applications. London, Springer Verlag, 921 pp. Go to original source...
    10. MELICHAR, B., VAGNER, L., 2008. Compiler Construction. 132 pp.
    11. MOLNÁR, Ľ., ČEŠKA, M., MELICHAR, B., 1987: Gramatiky a jazyky. Bratislava, Alfa, 192 pp.
    12. MURCHING, A. M., PRASAD, Y. V., SRIKANT, Y. N., 1990: Incremental Recursive Descent Parsing. Computer Languages, 15 (4), pp. 193-204. DOI: 10.1016/0096-0551(90)90020-P Go to original source...
    13. OLŠÁK, P., 2001: TEXbook naruby. Brno: Konvoj, 468 pp. ISBN 80-7302-007-6.
    14. ROZENBERG, G., SALOMAA, A. (eds.), 1997: Handbook of Formal Languages. Vol. 1: Word, Language, Grammar. Berlin: Springer-Verlag, 873 pp. ISBN 3-540-60620-0.
    15. SHILLING, J. J., 1992: Incremental LL(1) Parsing in Language-Based Editors. IEEE Trans. Softw. Eng., 19 (9), pp. 935-940. DOI: 10.1109/32.241775 Go to original source...
    16. TOMITA, M., 1987: An Efficient Augmented-Context-Free Parsing Algorithm. Computational Linguistics, Vol. 13, pp. 31-46.
    17. WAGNER, T. A., 1998: Practical Algorithm for Incremental Software Development Environments. Dissertation Thesis. 148 pp.
    18. WAGNER, T. A., GRAHAM, S. L., 1997: Incremental Analysis of Real Programming Languages, 1997 ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 31-43. Go to original source...
    19. WAGNER, T. A., GRAHAM, S. L., 1998: Efficient and Flexible Incremental Parsing. ACM Transactions on Programming Languages and Systems. Vol. 20, No. 2. Go to original source...
    20. YANG, W., 1993: An Incremental LL(1) Parsing Algorithm. Information Processing Letters, Vol. 48, Issue 2, pp. 67-72. DOI: 10.1016/0020-0190(93)90179-D Go to original source...
    21. YANG, W., 1994: Incremental LR Parsing. 1994 International Computer Symposium Conference Proceedings, vol. 1, pp. 577-583.

    This is an open access article distributed under the terms of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License (CC BY NC ND 4.0), which permits non-comercial use, distribution, and reproduction in any medium, provided the original publication is properly cited. No use, distribution or reproduction is permitted which does not comply with these terms.


    Return to the content