Bottom-Up Parsers: A Survey
This study offers a thorough analysis of bottom-up parsing techniques, necessary for the creation and execution of compilers. Parsers such as SLR (Simple LR), LR (Canonical LR), LR(k) and LALR (Look-Ahead LR) are bottom-up and known for their efficiency and robustness in constructing parse trees fro...
Saved in:
Published in | Computation System and Information Technology for Sustainable Solutions (CSITSS), International Conference on pp. 1 - 6 |
---|---|
Main Authors | , , , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
07.11.2024
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | This study offers a thorough analysis of bottom-up parsing techniques, necessary for the creation and execution of compilers. Parsers such as SLR (Simple LR), LR (Canonical LR), LR(k) and LALR (Look-Ahead LR) are bottom-up and known for their efficiency and robustness in constructing parse trees from root to leaves during syntax analysis. This paper follows the evolution throughout history, theoretical bases, and real-world uses of these parsers. We examine the formal characteristics, contrast different bottom-up parsing methods, and investigate advanced subjects like error handling and optimization techniques. Furthermore, there is a review of recent developments and upcoming research paths in bottom-up parsing to provide a comprehensive grasp of their significance in syntactic analysis. |
---|---|
ISSN: | 2767-1097 |
DOI: | 10.1109/CSITSS64042.2024.10816907 |