Compiler Design

Assigment-5

(CSL0620)

SUBMITED TO :- SUBMITED BY:-

Mr. Krishna Kumar Joshi Kartik Raj
Assit. Professor BETN1CS17026
 Consider the following grammar:
SaAb/bBc/cAa
AqS/p
BrA/q

(i) Check if the given grammar is operator grammar

or not?
: Since , No 2 adjacent variable and No NULL
production in ths grammer.
The given grammar is operator grammar.

(ii) Compute LEADING() Function for every non

terminal.
: LEADING(S) = { a, b, c }
LEADING(A) = { q , p}
LEADING(B) = { r , q }

(iii) Compute TRAILING() Function for every non

terminal.
: TRAILING(S) = { c , b , a }

TRAILING(A) = {p , q , c , b , a }
 TRAILING(B) = {q , r , p , c , b , a }

(iv) Construct Operator Precedence Parsing For the

above grammar.
a b C p q r $
a >
b >
c >
p >
q >
r >
$ < < < < < < A