Posted inCompiler Design
Finite Automata
Finite automata is a state machine that takes a string of symbols as input and…
Posted inCompiler Design
RECOGNITION OF TOKENS
Consider the following grammar fragment: stmt → if expr then stmt | if expr then…
Posted inCompiler Design
SPECIFICATION OF TOKENS
There are 3 specifications of tokens: 1)Strings 2) Language 3)Regular expression Strings and Languages · An alphabet or character…
Posted inCompiler Design
Tokens
Lexemes are said to be a sequence of characters (alphanumeric) in a token. There are…
Posted inCompiler Design
Input Buffering in Compiler Design
The lexical analyzer scans the input from left to right one character at a time.…
Posted inCompiler Design
Roles of the Lexical analyzer
Lexical analyzer performs below given tasks: Helps to identify token into the symbol table Removes…
Posted inCompiler Design
Architecture
A compiler can broadly be divided into two phases based on the way they compile.…
Posted inCompiler Design
Lexical Analysis
Lexical analysis is the first phase of a compiler. It takes the modified source code…
Posted inCompiler Design
Phases of Compiler
The compilation process is a sequence of various phases. Each phase takes input from its…
Posted inCloud Computing
Enterprise Cloud Computing
Enterprise Cloud Computing refers to a computing environment residing behind a firewall that delivers software, infrastructure…