An exploration on lexical analysis

Farhanaaz,; Sanju, V.

doi:10.1109/iceeot.2016.7755127

Cited by 6 publications

(4 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The implementation of the Lexical Analyzer is generally straightforward and can be conducted either manually or through automated means [11][12][13][14][15]. However, the deployment of the Syntax Analyzer presents more complex challenges.…”

Section: Limitations Of Conventional Parsing Approachesmentioning

confidence: 99%

An Innovative Approach to Syntax-Free Interpretation in Functional Programming Languages

Alaqeeli

2023

ISI

View full text Add to dashboard Cite

In the realm of programming languages, interpreters fundamentally rely on syntax analysis (parsing) for establishing a correct evaluation hierarchy. Traditional parsing methods, however, present limitations in terms of optimization. This study introduces an innovative approach that circumvents syntax analysis in the interpretation of functional programming languages. The proposed method employs a novel subroutine, transforming program expressions into a series of atomic expressions, herein referred to as the "molecular program." Each atomic expression within this molecular program constitutes an element of the program's lexicon, assigned a unique identifier that supplants its role in the original expression. The evaluation process adopts a recursive methodology, where the evaluation of a single variable invariably leads to the sequential evaluation of related variables. For the purposes of clarity and demonstration, this approach is exemplified using Lucid, a notable functional programming language. It is posited that this syntax-free interpretation method can be universally applied to any functional programming language that operates on the principles of expressions, functions, or formulas. The efficacy of this method is validated through rigorous testing, suggesting an enhancement in the efficiency of programming language interpretation.

show abstract

Section: Limitations Of Conventional Parsing Approachesmentioning

confidence: 99%

An Innovative Approach to Syntax-Free Interpretation in Functional Programming Languages

Alaqeeli

2023

ISI

View full text Add to dashboard Cite

show abstract

“…2) Implement the lexer: To break down the input in a sequence of tokens by writing code that can match the various tokens in the language and define functions to handle the lexing process [6] proposed lexer was implemented.…”

Section: Proposed Systemmentioning

confidence: 99%

“…2) Scientific computing: A language with fast and efficient variable lookup could be useful in the field of scientific computing, where complex simulations and calculations require fast and efficient access to variables. For example, you could use a $-prefixed variable to represent a physical parameter or simulation variable, making it easy to access and modify these values as needed [6].…”

Section: Future Scopementioning

confidence: 99%

See 1 more Smart Citation

Design of efficient Programming Language with Lexer using ’$’-prefixed identifier

Gupta,

Kumar,

Santosh

et al. 2023

ICST Transactions on Scalable Information Systems

View full text Add to dashboard Cite

An identifier which starts with ‘$‘is known as ‘$‘-prefixed identifier and this type of identifiers are used in our research paper to improve the lexical analysis phase. This paper talks about a new programming language with ‘$‘-prefixed identifier that features a novel approach for optimizing the lexer for efficient lexical analysis which can be applied to any existing language. This approach is used to classify identifiers and keywords using ‘$‘-prefixed variables, which significantly reduces the time taken and number of iterations required during the tokenization process, leading to improved overall performance. This type of language structure allows for fast lookup and matching of tokens. We conducted a series of experiments to evaluate the performance of our lexer and compared it with a regular lexer. Our results show that our approach leads to significant improvements in time complexity and number of iterations for identifying whether the token is an identifier or a keyword, resulting in faster compilation times and improved overall performance. Our language has reduced the amount of time taken by 7-10% and 45-50% in terms of iterations. Our language and lexer represent a significant step forward in the design and implementation of high-performance programming languages by reducing the number of iterations and time taken to identify whether a token is a keyword or an identifier.

show abstract