Hawassa University

Department of Computer Science

Compiler Design

Course code: CoSc4072

By: Mekonen M.
 Topics to be covered
 Looping
• Syntax directed translation
• Syntax directed definitions
• Synthesized attributes
• Inherited attribute
• Dependency graph
• Evaluation order
• Bottom up evaluation of S-attributed definitions
• L-Attributed definitions
• Translation scheme
A Step-Back

CHAPTER TWO
•Strings
•Regular expressions
•Tokens
•Transition diagrams
•Finite Automata

Mekonen M. # CoSc4072  Unit 4 – Syntax Directed Translation 4

A Step-Back

CHAPTER THREE
• Grammars
• Derivations
• Parse-trees
• Top-down parsing (LL)
• Bottom-up paring (LR, SLR,LALR)

Mekonen M. # CoSc4072  Unit 4 – Syntax Directed Translation 5

Semantic Analysis
▪ Semantic Analysis checks the source program for semantic errors.
▪ It uses the hierarchical structure determined by the syntax analysis
phase to identify the operators and operands of expressions and
statement.
▪ Semantic analysis performs type checking., it checks that, whether
each operator has operands that are permitted by the source language
specification.
• Example: If a real numbers is used to index an array i.e., a[1.5] then the
compiler will report an error. This error is handled during semantic
analysis.

Mekonen M. # CoSc4072  Unit 4 – Syntax Directed Translation 6

What a semantic analyzer do?
 Semantic analysis judges whether the syntax structure constructed in the
source program derives any meaning or not.
 For Example
• int a = “value”;
◼ should not issue an error in lexical and syntax analysis phase, as it is lexically and structurally
correct, but it should generate a semantic error as the type of the assignment differs
 The following tasks should be performed in semantic analysis:
• Scope resolution
• Type checking
• Array-bound checking

Mekonen M. # CoSc4072  Unit 4 – Syntax Directed Translation 7

Semantics errors
 These are some of the semantics errors that the semantic analyzer is
expected to recognize:
• Type mismatch
• Undeclared variable
• Reserved identifier misuse
• Multiple declaration of variable in a scope.
• Accessing an out of scope variable.
• Actual and formal parameter mismatch.

Mekonen M. # CoSc4072  Unit 4 – Syntax Directed Translation 8

Syntax directed translation(SDT)
• Refers to a method of compiler implementation where the source
language translation is completely driven by the parser. It is the
translation of languages guided by context free grammars.
• Grammar symbols are associated with attributes to associate
information with the programming language constructs that they
represent. Values of these attributes are evaluated by the semantic
rules associated with the production rules.
• When we associate semantic rules with productions, we use two
notations:
• Syntax-Directed Definitions
• Translation Schemes

Mekonen M. # CoSc4072  Unit 4 – Syntax Directed Translation 9

Syntax directed definitions (SDD)
• Syntax directed definition is a generalization of context free grammar in which
each grammar symbol has an associated set of attributes.
• An attribute has a name and an associated value: it can be a number, type,
memory location, return type etc…. - whatever information we need.
• Each production rule is associated with a set of semantic rules, which describe
how to compute the attribute values associated with each grammar symbol in a
production.
SDD = Grammar + Sematic rule
• Types of attributes are:
1. Synthesized attribute
2. Inherited attribute
E. Value
Memory
Type
Return location
Type
Mekonen M. # CoSc4072  Unit 4 – Syntax Directed Translation 10
Synthesized attributes
• Value of synthesized attribute at a node can be computed from the value of attributes at the children of that
node in the parse tree.
• A syntax directed definition that uses synthesized attribute exclusively is said to be S-attribute definition.
• Example: Syntax directed definition of simple desk calculator
Production Semantic rules

L → En Print (E.val)

E → E1+T E.val = E1.val + T.val

E→T E.val = T.val

T → T1*F T.val = T1.val * F.val

T→F T.val = F.val

F → (E) F.val = E.val

F → digit F.val = digit.lexval

Mekonen M. # CoSc4072  Unit 4 – Syntax Directed Translation 11

Example: Synthesized attributes
String: 3*5+4n;
Production Semantic rules
L
L → En Print (E.val)
n
E.val=19
E → E1+T E.Val = E1.val + T.val

E→T E.Val = T.val

+ T.val=4
E.val=15
T → T1*F T.Val = T1.val * F.val
The process of computing the
T.val=15 F.val=4 attribute values at the node is T→F T.Val = F.val
called annotating or
decorating the parse tree F → (E) F.Val = E.val
* digit.lexval=4
T.val=3 F.val=5 F → digit F.Val = digit . lexval

F.val=3 digit.lexval=5
parse tree showing the value
digit.lexval=3 of the attributes at each node
is called Annotated parse tree
Annotated parse tree for 3*5+4n

Mekonen M. # CoSc4072  Unit 4 – Syntax Directed Translation 12

Exercise
Draw Annotated Parse tree for following:
1. 7+3*2n
2. (3+4)*(5+6)n

Mekonen M. # CoSc4072  Unit 4 – Syntax Directed Translation 13

Inherited attribute
• An inherited value at a node in a parse tree is computed from the value of
attributes at the parent and/or siblings of the node.

Production Semantic rules

D→TL L.in = T.type
T → int T.type = integer
T → real T.type = real
L → L1 , id L1.in = L.in, addtype(id.entry,L.in)
L → id addtype(id.entry,L.in)

Syntax directed definition with inherited attribute L.in

• Symbol T is associated with a synthesized attribute type.

• Symbol L is associated with an inherited attribute in.
Mekonen M. # CoSc4072  Unit 4 – Syntax Directed Translation 15
Example: Inherited attribute
Example: Pass data types to all identifier real id1,id2,id3

D
Production Semantic rules
D→TL L.in = T.type LL.in=real
T
T.type=real
T → int T.type = integer
real ,
T → real T.type = real id
id3
L1
L.in=real
L → L1 , id L1.in = L.in,
addtype(id.entry,L.in)
,
L → id addtype(id.entry,L.in) L.in=real
L1 id2
id

id
id1

D→TL
L → Lid
1 , id

Mekonen M. # CoSc4072  Unit 4 – Syntax Directed Translation 16

Dependency graph
• The directed graph that represents the interdependencies between synthesized
and inherited attribute at nodes in the parse tree is called dependency graph.
• For the rule X→YZ the semantic action is given by X.x=f(Y.y, Z.z) then synthesized
attribute X.x depends on attributes Y.y and Z.z.
• The basic idea behind dependency graphs is for a compiler to look for various
kinds of dependency among statements to prevent their execution in wrong order.

Mekonen M. # CoSc4072  Unit 4 – Syntax Directed Translation 18

Algorithm : Dependency graph
for each node n in the parse tree do
for each attribute a of the grammar symbol at n do
Construct a node in the dependency graph for a;
for each node n in the parse tree do
for each semantic rule b=f(c1,c2,…..,ck)
associated with the production used at n do
for i=1 to k do
construct an edge from the node for Ci to the node for b;

Mekonen M. # CoSc4072  Unit 4 – Syntax Directed Translation 19

Example: Dependency graph
Example:
Production Semantic rules
E→E1+E2 E→E1+E2 E.val = E1.val+E2.val

Parse tree Dependency graph

val
E

E1 E2
val + val

𝑬. 𝒗𝒂𝒍 is synthesized from 𝑬𝟏. 𝒗𝒂𝒍 and 𝑬𝟐. 𝒗𝒂𝒍

The edges to E.val from E1.val and E2.val shows that E.val is depends on E1.val and E2.val

Mekonen M. # CoSc4072  Unit 4 – Syntax Directed Translation 20

Evaluation order
• A topological sort of a directed acyclic graph is any ordering 𝑚1, 𝑚2, … … … . . , 𝑚𝑘 of the
nodes of the graph such that edges go from nodes earlier in the ordering to later nodes.
• If 𝑚𝑖→𝑚𝑗 is an edge from 𝑚𝑖 to 𝑚𝑗 then 𝑚𝑖 appears before 𝑚𝑗 in the ordering.

1 T.type=real L.in=real 2

real 3 ,
L.in=real id3 4

,
5 L.in=real id2 6

7 id1

Mekonen M. # CoSc4072  Unit 4 – Syntax Directed Translation 21

Bottom up evaluation of S-attributed definitions
• S-attributed definition is one such class of syntax directed definition with synthesized
attributes only.
• Synthesized attributes can be evaluated using bottom up parser only.
Synthesized attributes on the parser stack
• Consider the production A→XYZ and associated semantic action is A.a=f(X.x, Y.y, Z.z)

State Value State Value

top-2 𝑋 𝑋. 𝑥 top 𝐴 𝐴. 𝑎
top-1 𝑌 𝑌. 𝑦
top 𝑍 𝑍. 𝑧
Before reduction After reduction

Mekonen M. # CoSc4072  Unit 4 – Syntax Directed Translation 23

Bottom up evaluation of S-attributed definitions
Production Semantic rules Input State Val Production Used
L → En Print (val[top]) 3*5n - -
E → E1+T val[top]=val[top-2] + val[top]
*5n 3 3
*5n F 3 F→digit
E→T
*5n T 3 T→F
T → T1*F val[top]=val[top-2] * val[top]
5n T* 3
T→F n T*5 3,5
F → (E) val[top]=val[top-2] - val[top] n T*F 3,5 F→digit
F → digit n T 15 T→T1*F
n E 15 E→T
Implementation of a desk calculator En 15
with bottom up parser L 15 L → En
Move made by translator

Mekonen M. # CoSc4072  Unit 4 – Syntax Directed Translation 24

L-Attributed definitions
• A syntax directed definition is L-attributed if each inherited attribute of 𝑋𝑗, 1 <= 𝑗 <=
𝑛, on the right side of 𝐴→𝑋1, 𝑋2 … 𝑋𝑛 depends only on:
1. The attributes of the symbols 𝑋1, 𝑋2, … 𝑋j-1 to the left of 𝑋𝑗 in the production and
2. The inherited attribute of A.
• Example: Production Semantic Rules
A→ LM L.i:=l(A.i)
M.i=m(L.s)
A→XYZ A.s=f(M.s)
A→ QR R.i=r(A.i)
Q.i=q(R.s)
NotL- Attributed
L-Attributed  A.s=f(Q.s)

• Above syntax directed definition is not L-attributed because the inherited attribute Q.i of
the grammar symbol Q depends on the attribute R.s of the grammar symbol to its right.

Mekonen M. # CoSc4072  Unit 4 – Syntax Directed Translation 26

Bottom up evaluation of S-attributed definitions
• Translation scheme is a context free grammar in which attributes are associated
with the grammar symbols and semantic actions enclosed between braces { } are
inserted within the right sides of productions.
• Attributes are used to evaluate the expression along the process of parsing.
• During the process of parsing the evaluation of attribute takes place by consulting
the semantic action enclosed in { }.
• A translation scheme generates the output by executing the semantic actions in
an ordered manner.
• This process uses the depth first traversal.

Mekonen M. # CoSc4072  Unit 4 – Syntax Directed Translation 28

Example: Translation scheme (Infix to postfix notation)
String: 9-5+2 E→TR
R→ addop 𝑇 𝑃𝑟𝑖𝑛𝑡 𝑎𝑑𝑑𝑜𝑝. 𝑙𝑒𝑥𝑒𝑚𝑒 R1 | 𝜖
E
T→ num 𝑃𝑟𝑖𝑛𝑡 𝑛𝑢𝑚. 𝑣𝑎𝑙

T R

- R
9 {Print(9)} T {Print(-)}

5 {Print(5)} + R
T {Print(+)}

2 {Print(2)} 𝜖

Now, Perform Depth first traversal Postfix=95-2+

Mekonen M. # CoSc4072  Unit 4 – Syntax Directed Translation 29