Compiler Design

The syntax analysis phase is the second phase of a compiler. It takes input from the lexical analyzer. And provides an output that serves as input to the semantic analyzer. Syntax analysis is also referred to as syntax analyzer or parser. It reads the string of tokens from the lexical analyzer. And confirm that it can be generated from the grammar used for the source … [Read more...] about Syntax Analysis in Compiler

Finite automata (FA) can be defined as a recognizer that identifies whether the input string represents the regular language. The finite automata accept the input string if the input string is a regular expression representing the regular language else it rejects it. In this section, we will discuss the finite automata, their types, how can we convert them into regular … [Read more...] about Finite Automata in Compiler Design

Lexical Analysis in compiler is the first step in the analysis of the source program. The lexical analysis reads the input stream from the source program character by character and produces the sequence of tokens. These tokens are provided as an input to the parser for parsing. In this context, we will be discussing the process of lexical analysis in brief along with the … [Read more...] about Lexical Analysis in Compiler

A compiler in a computer is defined as a program that intakes a program written in a language say source language and transforms it into the equivalent program but in another language says target language. Apart from this translation the compiler also specifies errors present in the source program. In the section ahead, we will be discussing compiler in detail such as we … [Read more...] about Compiler in Computer