Example of phase of compiler – Lexical\/Syntax\/Semantic Intermediate Code Target<\/p>\n
[fvplayer id=”126″]<\/p>\n
A compiler translates high-level code<\/strong> into machine code<\/strong> through multiple phases. These phases can be categorized into front-end (analysis)<\/strong> and back-end (synthesis)<\/strong> processes.<\/p>\n Purpose:<\/strong> Converts source code into a sequence of tokens<\/strong>.<\/p>\n<\/li>\n Example:<\/strong> Output (Tokens):<\/strong><\/p>\n Tool Used:<\/strong> Lexical Analyzer (Lexer)<\/p>\n Purpose:<\/strong> Checks if tokens form a valid syntax according to the language grammar.<\/p>\n<\/li>\n Example:<\/strong> Parsing Tree (Abstract Syntax Tree – AST):<\/strong><\/p>\n Error Detected:<\/strong> Missing semicolon ( Tool Used:<\/strong> Parser<\/p>\n Purpose:<\/strong> Ensures code makes logical sense<\/strong> (type checking, scope checking, etc.).<\/p>\n<\/li>\n Example:<\/strong> Error:<\/strong> Tool Used:<\/strong> Semantic Analyzer<\/p>\n Purpose:<\/strong> Converts the code into an intermediate representation (IR)<\/strong> that is independent of machine architecture<\/strong>.<\/p>\n<\/li>\n Example (Three-Address Code Representation):<\/strong> Intermediate Code (Three-Address Code – TAC):<\/strong><\/p>\n Tool Used:<\/strong> Intermediate Code Generator<\/p>\n Purpose:<\/strong> Converts intermediate code<\/strong> into machine code (assembly language)<\/strong> for execution.<\/p>\n<\/li>\n Example (x86 Assembly Code):<\/strong><\/p>\n Tool Used:<\/strong> Code Generator<\/p>\n Would you like me to explain Compiler Optimizations<\/strong> as well?<\/p>\n\u00a01. Lexical Analysis (Tokenization)<\/strong><\/h3>\n
\n
Input Code (C language):<\/strong><\/p>\nint<\/span> x = 10<\/span>;
\n<\/code><\/div>\n<\/div>\nKeyword: int<\/span>
\nIdentifier: x<\/span>
\nOperator: =<\/span>
\nNumber: 10<\/span>
\nSymbol: ;<\/span>
\n<\/code><\/div>\n<\/div>\n<\/li>\n<\/ul>\n\u00a02. Syntax Analysis (Parsing)<\/strong><\/h3>\n
\n
Input Tokens:<\/strong><\/p>\nint<\/span> x = 10<\/span>;
\n<\/code><\/div>\n<\/div>\n =
\n\/ \\
\nint<\/span> 10<\/span>
\n\\
\nx
\n<\/code><\/div>\n<\/div>\n;<\/code>) or incorrect placement of keywords.<\/p>\n<\/li>\n<\/ul>\n\u00a03. Semantic Analysis (Meaning Verification)<\/strong><\/h3>\n
\n
Input Code:<\/strong><\/p>\nint<\/span> x;
\nx = \"Hello\"<\/span>; \/\/ Error: Type mismatch<\/span>
\n<\/code><\/div>\n<\/div>\nx<\/code> is declared as an integer, but assigned a string value.<\/p>\n<\/li>\n<\/ul>\n\u00a04. Intermediate Code Generation<\/strong><\/h3>\n
\n
Input Code:<\/strong><\/p>\na = b + c * d;
\n<\/code><\/div>\n<\/div>\nt1<\/span> = c * d
\nt2<\/span> = b + t1
\na<\/span> = t2
\n<\/code><\/div>\n<\/div>\n<\/li>\n<\/ul>\n\u00a05. Target Code Generation<\/strong><\/h4>\n
\n
MOV R1, c
\nMUL R1, d
\nMOV R2, b<\/span>
\nADD R2, R1
\nMOV a<\/span>, R2
\n<\/code><\/div>\n<\/div>\n<\/li>\n<\/ul>\n\u00a0Summary Table<\/strong><\/h3>\n
\n\n
\n \nPhase<\/th>\n Purpose<\/th>\n Example Output<\/th>\n<\/tr>\n<\/thead>\n \n Lexical Analysis<\/strong><\/td>\n Converts code into tokens<\/td>\n int \u2192 Keyword, x \u2192 Identifier<\/code><\/td>\n<\/tr>\n\n Syntax Analysis<\/strong><\/td>\n Creates syntax tree<\/td>\n Parses expressions a = b + c;<\/code><\/td>\n<\/tr>\n\n Semantic Analysis<\/strong><\/td>\n Checks for logical errors<\/td>\n Type mismatch: int vs string<\/code><\/td>\n<\/tr>\n\n Intermediate Code<\/strong><\/td>\n Converts code to IR (Three-Address Code)<\/td>\n t1 = c * d<\/code><\/td>\n<\/tr>\n\n Target Code Generation<\/strong><\/td>\n Generates machine\/assembly code<\/td>\n MOV R1, c<\/code><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\nExample of phase of compiler – Lexical\/Syntax\/Semantic Intermediate Code Target<\/a><\/h3>\n
Module 1 Compiler Phases of a Compiler ( Structure of …<\/h3>\n
Analysis of the source program, Phases of a compiler, …<\/a><\/h3>\n