Parser for TINY Language
This study provides a novel method to generate a compiler, which translates a program using TINY language. TINY language is a simple programming language which is designed to understand the basic concepts of compiler. A compiler is a type of program which is designed to convert the code written in high-level language into machine language that is understandable by the computer. The procedure for building a parser requires various sub-tasks, there are a list of operations that include parsing or splitting the code into tokens, checking's the code's syntax using grammar rules, understanding, interpreting and optimizing the provided code and generating the execution-ready code by the performance of last assembling. In order to face the challenges of compiler construction, which includes rule-based complex grammar, error handling, and fast tokenization, the python programming language is implemented for developing pyLexer(tokenization) and pyParsing (syntactic analysis) libraries. Lexer is used for matching regular expressions to return corresponding tokens(lexemes), while parser is supposed to check whether the given syntax is according to the grammar rules or not through recursion. Web application is created for this using Streamlit, which provides users with many useful features like text rendering capability, error highlighting and code suggestions.
Authors
- Meena Belwal (ORCID: https://orcid.org/0000-0002-9141-6815)
- Geetika Madan Patel (ORCID: https://orcid.org/0000-0003-3789-184X)
- Ch V V Narasimha Raju
- C. Priya
- Adrien Daniel
Institutions
- Amrita Vishwa Vidyapeetham (IN)
Publication Details
- Published
- 2024-11-07
- DOI
- https://doi.org/10.1109/csitss64042.2024.10816962
- Primary Topic
- Natural Language Processing Techniques
- Type
- article
- Field-Weighted Citation Impact
- 0.00