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 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.
Authors
- A. Karthik (ORCID: https://orcid.org/0000-0002-7354-4485)
- Meena Belwal (ORCID: https://orcid.org/0000-0002-9141-6815)
- B Venkat Vinod Kumar
- Bejji Bharadwaj Sree Sai Karthikeya
Institutions
- Amrita Vishwa Vidyapeetham (IN)
Publication Details
- Published
- 2024-11-07
- DOI
- https://doi.org/10.1109/csitss64042.2024.10816907
- Primary Topic
- Algorithms and Data Compression
- Type
- article
- Field-Weighted Citation Impact
- 0.00