Scribd
Upload
11 views

CD Chapter 1

The document provides an overview of compiler design, detailing the structure and functions of a compiler, including lexical analysis, parsing, semantic routines, optimization, and code generation. It explains the role of a lexical analyzer in identifying tokens, removing whitespace, and managing errors. Additionally, it covers applications of compiler technology and the use of regular expressions for token specification.

Uploaded by

Priyanshu Verma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
11 views

CD Chapter 1

The document provides an overview of compiler design, detailing the structure and functions of a compiler, including lexical analysis, parsing, semantic routines, optimization, and code generation. It explains the role of a lexical analyzer in identifying tokens, removing whitespace, and managing errors. Additionally, it covers applications of compiler technology and the use of regular expressions for token specification.

Uploaded by

Priyanshu Verma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 28

COMPILER DESIGN

SUBJECT CODE: 303105349


Ami sachin Shah, Assistant Professor
Computer Science & Engineering
CHAPTER-1
Overview of compilation
Contents

• The structure of a compiler and applications of compiler technology


• Lexical analysis - The role of a lexical analyzer

• specification of tokens
• recognition of tokens
• hand-written lexical analyzers
• LEX, examples of LEX programs.
Complier
•A compiler acts as a translator, transforming human-oriented programming languages into computer
oriented machine languages.
•Ignore machine-dependent details for programmer
The structure of a compiler
Any compiler must perform two major tasks

– Analysis of the source program


– Synthesis of a machine-language program
The structure of a compiler
The structure of a compiler
1 Scanner
The scanner begins the analysis of the source program by reading the input, character by
character, and grouping characters into individual words and symbols (tokens)

• RE ( Regular expression )
• NFA ( Non-deterministic Finite Automata )
• DFA ( Deterministic Finite Automata )
• LEX
The structure of a compiler
2- Parser
Given a formal syntax specification (typically as a context-free grammar [CFG] ), the parse
reads tokens and groups them into units as specified by the productions of the CFG being
used.
As syntactic structure is recognized, the parser either calls corresponding semantic
routines
directly or builds a syntax tree.
• CFG ( Context-Free Grammar )
• BNF ( Backus-Naur Form )
• GAA ( Grammar Analysis Algorithms )
• LL, LR, SLR, LALR Parsers
• YACC
The structure of a compiler
3 - Semantic Routines
Perform two functions
• Check the static semantics of each construct
• Do the actual translation
The heart of a compiler

• Syntax Directed Translation


• Semantic Processing Techniques
• IR (Intermediate Representation)
The structure of a compiler
4 - Optimizer
• The IR code generated by the semantic routines is analyzed and transformed into
functionally equivalent but improved IR code
• This phase can be very complex and slow
• Peephole optimization
• loop optimization, register allocation, code scheduling

• Register and Temporary Management


• Peephole Optimization
The structure of a compiler
5 - Code Generator
• Interpretive Code Generation
• Generating Code from Tree/Dag
• Grammar-Based Code Generator
Applications of compiler technology
Compiler technology is more broadly applicable and has been employed in rather
unexpected areas.
• Text-formatting languages,
like nroff and troff; preprocessor packages like eqn, tbl, pic
• Silicon compiler for the creation of VLSI circuits
• Command languages of OS
• Query languages of Database systems
Lexical analysis - The role of a lexical analyzer
Lexical analysis - The role of a lexical analyzer

Lexical analyzer performs below given tasks:

•Helps to identify token into the symbol table

•Removes white spaces and comments from the source program

•Correlates error messages with the source program

•Helps you to expands the macros if it is found in the source program

•Read input characters from the source program


Lexical analysis - The role of a lexical analyzer

Tokens, Patterns and Lexemes

A token is a pair a token name and an optional token value

A pattern is a description of the form that the lexemes of a token may take

A lexeme is a sequence of characters in the source program that matches the pattern for a token
Lexical analysis - The role of a lexical analyzer

Example
Lexical analysis - The role of a lexical analyzer

Attributes for tokens:

E = M * C ** 2
<id, pointer to symbol table entry for E>
<assign-op>
<id, pointer to symbol table entry for M>
<mult-op>
<id, pointer to symbol table entry for C>
<exp-op>
<number, integer value 2>
Lexical analysis - The role of a lexical analyzer

Lexical errors:
A character sequence which is not possible to scan into any valid token is a lexical error. Important facts about
the lexical error
• Misspelling of identifiers, operators, keyword are considered as lexical errors
• Generally, a lexical error is caused by the appearance of some illegal character, mostly at the beginning of a
token.
e.g: int @a1;
Above statement has lexical error because identifier (@a1) can’t start with special character
Lexicalanalysis
Lexical analysis--The
Therole
roleof
ofaalexical
lexicalanalyzer
analyzer

Error Recovery in Lexical Analyzer

• Removes one character from the remaining input


• In the panic mode, the successive characters are always ignored until we reach a well-formed token
• By inserting the missing character into the remaining input
• Replace a character with another character
• Transpose two serial characters
Specification of tokens

• In theory of compilation regular expressions are used to formalize the specification of tokens
• Regular expressions are means for specifying regular languages
Example:
letter_(letter_ | digit)*
• Each regular expression is a pattern specifying the form of
strings
Recognition of tokens

• digit -> [0-9]


• Digits -> digit+
• number -> digit(.digits)? (E[+-]? Digit)?
• letter -> [A-Za-z_]
• id -> letter (letter|digit)*
• If -> if
• Then -> then
• Else -> else
• Relop -> < | > | <= | >= | = | <>
Transition diagram for relop:
Recognition of tokens
Recognition ofreserved
Transition diagram for tokens words and identifiers :
Recognition ofunsigned
Transition diagram for tokens numbers :
hand-written lexical analyzers
TOKEN getRelop()
{
TOKEN retToken = new (RELOP)
while (1) { /* repeat character processing until a
return or failure occurs */
switch(state) {
case 0: c= nextchar();
if (c == ‘<‘) state = 1;
else if (c == ‘=‘) state = 5;
else if (c == ‘>’) state = 6;
else fail();

/* lexeme is not a relop */ break;


case 1: …
…
case 8: retract();
retToken.attribute = GT;
return(retToken);
}
Lexical Analyzer Generator - Lex
Structure of Lex programs
A lex program consists of three parts: the definition section, the rules section, and the user subroutines.

...definition section ...

%%
... rules section...

%%
... user subroutines ...
www.paruluniversity.ac.in

You might also like