2022, Vol. 3, Issue 1, Part A
Applications of finite automata towards string acceptance and lexical analysis
Author(s): C Lanston Davis
Abstract: In this paper, we would like to discuss about the Applications of Finite Automata towards String Acceptance and Lexical Analysis. It was in 1943 when Warren McCulloch and Walter Pitts contented their idea (to create a human approach process) along with some neurologists, mathematicians and by some the first computer scientists. A lot more information was gathered, relating to Finite automata, Pushdown Automata, Turing machine etc. Finite Automata is basically a compiler where it constructs itself to provide its application in phases such as Lexical Analyzers, Synthetic Analyzers, Code Generation, Intermediate Code Generation, Code Optimization etc. which can be helpful for many basic machines such as text editors spell cheekers, for designing sequential circuits too. Lexical analyzers are very much useful in computing complex sequence of characters into tokens where the tokens have a definite set of meaning which could be decoded by the computer. As said earlier, the analysis helps in the division of the program to be compiled into separate tokens, then it helps in detecting the error tokens and aids the user by directing out the line and array of error (points out the row and column number of errors precisely), it removes the unnecessary comments and spaces too. So, in this research paper we will inform you more in detail about its applications which will further deal with string acceptance, and what and how are necessary for the above-mentioned functions, and discuss in detail how Finite Automata which clearly has no space or said to have “Finite Space” for a limited time period would help to do such tasks as compilers.
Pages: 05-12 | Views: 489 | Downloads: 161
Download Full Article: Click Here
How to cite this article:
C Lanston Davis. Applications of finite automata towards string acceptance and lexical analysis. Int J Res Circuits Devices Syst 2022;3(1):05-12.