LL(1) Conflict Resolution in a Recursive Descent Compiler Generator

Hanspeter Mössenböck; Albrecht Wöß; Markus Löberbauer

doi:10.1007/978-3-540-45213-3_25

LL(1) Conflict Resolution in a Recursive Descent Compiler Generator

Hanspeter Mössenböck
, Albrecht Wöß
, Markus Löberbauer

Institute for Systems Software

Research output: Chapter in Book/Report/Conference proceeding › Conference proceedings › peer-review

Abstract

Recursive descent parsing is restricted to languages whose grammars are LL(1), i.e., which can be parsed top-down with a single lookahead symbol. Unfortunately, many languages such as Java, C++, or C# are not LL(1). There-fore recursive descent parsing cannot be used or the parser has to make its deci-sions based on semantic information or a multi-symbol lookahead. In this paper we suggest a systematic technique for resolving LL(1) conflicts in recursive descent parsing and show how to integrate it into a compiler gen-erator (Coco/R). The idea is to evaluate user-defined boolean expressions, in order to allow the parser to make its parsing decisions where a one symbol loo-kahead does not suffice. Using our extended compiler generator we implemented a compiler front end for C# that can be used as a framework for implementing a variety of tools.

Original language	English
Title of host publication	Modular Programming Languages
Publisher	Springer Verlag Heidelberg
Pages	192-201
Number of pages	10
Volume	2789
ISBN (Print)	3-540-40796-0
DOIs	https://doi.org/10.1007/978-3-540-45213-3_25
Publication status	Published - Aug 2003

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)	0302-9743

Fields of science

102 Computer Sciences
102009 Computer simulation
102011 Formal languages
102013 Human-computer interaction
102029 Practical computer science
102022 Software development
102024 Usability research

Access to Document

10.1007/978-3-540-45213-3_25

Cite this

Mössenböck, H., Wöß, A., & Löberbauer, M. (2003). LL(1) Conflict Resolution in a Recursive Descent Compiler Generator. In Modular Programming Languages (Vol. 2789, pp. 192-201). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). Springer Verlag Heidelberg. https://doi.org/10.1007/978-3-540-45213-3_25

@inproceedings{03e7453984cb44369f0b0c18da5572ae,

title = "LL(1) Conflict Resolution in a Recursive Descent Compiler Generator",

abstract = "Recursive descent parsing is restricted to languages whose grammars are LL(1), i.e., which can be parsed top-down with a single lookahead symbol. Unfortunately, many languages such as Java, C++, or C\# are not LL(1). There-fore recursive descent parsing cannot be used or the parser has to make its deci-sions based on semantic information or a multi-symbol lookahead. In this paper we suggest a systematic technique for resolving LL(1) conflicts in recursive descent parsing and show how to integrate it into a compiler gen-erator (Coco/R). The idea is to evaluate user-defined boolean expressions, in order to allow the parser to make its parsing decisions where a one symbol loo-kahead does not suffice. Using our extended compiler generator we implemented a compiler front end for C\# that can be used as a framework for implementing a variety of tools.",

author = "Hanspeter M{\"o}ssenb{\"o}ck and Albrecht W{\"o}{\ss} and Markus L{\"o}berbauer",

year = "2003",

month = aug,

doi = "10.1007/978-3-540-45213-3\_25",

language = "English",

isbn = "3-540-40796-0",

volume = "2789",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag Heidelberg",

pages = "192--201",

booktitle = "Modular Programming Languages",

}

Mössenböck, H, Wöß, A & Löberbauer, M 2003, LL(1) Conflict Resolution in a Recursive Descent Compiler Generator. in Modular Programming Languages. vol. 2789, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer Verlag Heidelberg, pp. 192-201. https://doi.org/10.1007/978-3-540-45213-3_25

LL(1) Conflict Resolution in a Recursive Descent Compiler Generator. / Mössenböck, Hanspeter; Wöß, Albrecht; Löberbauer, Markus.
Modular Programming Languages. Vol. 2789 Springer Verlag Heidelberg, 2003. p. 192-201 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

Research output: Chapter in Book/Report/Conference proceeding › Conference proceedings › peer-review

TY - GEN

T1 - LL(1) Conflict Resolution in a Recursive Descent Compiler Generator

AU - Mössenböck, Hanspeter

AU - Wöß, Albrecht

AU - Löberbauer, Markus

PY - 2003/8

Y1 - 2003/8

N2 - Recursive descent parsing is restricted to languages whose grammars are LL(1), i.e., which can be parsed top-down with a single lookahead symbol. Unfortunately, many languages such as Java, C++, or C# are not LL(1). There-fore recursive descent parsing cannot be used or the parser has to make its deci-sions based on semantic information or a multi-symbol lookahead. In this paper we suggest a systematic technique for resolving LL(1) conflicts in recursive descent parsing and show how to integrate it into a compiler gen-erator (Coco/R). The idea is to evaluate user-defined boolean expressions, in order to allow the parser to make its parsing decisions where a one symbol loo-kahead does not suffice. Using our extended compiler generator we implemented a compiler front end for C# that can be used as a framework for implementing a variety of tools.

AB - Recursive descent parsing is restricted to languages whose grammars are LL(1), i.e., which can be parsed top-down with a single lookahead symbol. Unfortunately, many languages such as Java, C++, or C# are not LL(1). There-fore recursive descent parsing cannot be used or the parser has to make its deci-sions based on semantic information or a multi-symbol lookahead. In this paper we suggest a systematic technique for resolving LL(1) conflicts in recursive descent parsing and show how to integrate it into a compiler gen-erator (Coco/R). The idea is to evaluate user-defined boolean expressions, in order to allow the parser to make its parsing decisions where a one symbol loo-kahead does not suffice. Using our extended compiler generator we implemented a compiler front end for C# that can be used as a framework for implementing a variety of tools.

UR - https://www.scopus.com/pages/publications/35248823679

U2 - 10.1007/978-3-540-45213-3_25

DO - 10.1007/978-3-540-45213-3_25

M3 - Conference proceedings

SN - 3-540-40796-0

VL - 2789

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

SP - 192

EP - 201

BT - Modular Programming Languages

PB - Springer Verlag Heidelberg

ER -

LL(1) Conflict Resolution in a Recursive Descent Compiler Generator

Abstract

Publication series

Fields of science

Access to Document

Other files and links

Cite this