Scribd
Upload
3 views100 pages

Toc 3

The document appears to be a technical publication focused on formal languages, grammars, and parsing techniques. It includes various examples of grammar rules, derivations, and parse trees, illustrating concepts such as regular expressions and context-free grammars. The content is highly technical and likely intended for an audience familiar with computational theory and language processing.

Uploaded by

santa.claus975311
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views100 pages

Toc 3

The document appears to be a technical publication focused on formal languages, grammars, and parsing techniques. It includes various examples of grammar rules, derivations, and parse trees, illustrating concepts such as regular expressions and context-free grammars. The content is highly technical and likely intended for an audience familiar with computational theory and language processing.

Uploaded by

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

TM

TECHNICAL PUBLICATIONS - An up thrust for knowledge


Sentence

Noun Verb

Sita Sings

G =(V, T, P, S)
l

l l l l l
a
L n bn where n 1
L wcwT

a a

a b a

a b c b a

madam
read read

It is the same !
a a
ab ba
abaab
abaaba
abaaba

a aa a a

aa aa a a

aa aaba

aa a aab a a

aa a aabab
A aa

one occurrence
anything
of double

a
ab
ab
abaa
abaab
abaab
abaab

0, 1
1

a n bn

a xb y | x y

bR2 | b

regular expression = (110 + 11)* (10)*

Can be represented
by the non
terminal
A B
0i 1j 2k | j i k

0 i 1 j 2k

i i k p k
L = 0 1 1 1 2

This will be
greater than
i+k
i i p k k
L= 0 1 1 1 2

define
rule using define rule
define using
rule using B
C
NT A

0i 1j 2k | i j

0i 1j 2k | j k

L1 0i 1j 2 j
L2 0i 1j 2 k
0i 1j 2 j 2 k
2n
a b
S A B
a b
b b a
qf

C
a
qf

a b
S A B
a b

b a

b a
C

b a

a b
S A B

a aa b b b

0 m 1n 0 m n m, n 0 0 a 1b 2 c a–c b

0m 1n 0m n
am bn | n m
S
A

B
a,b

S T
a,b

L {a n b m|n m}
{a n b m c k|n m or m k}

a n b m c k|n m
a n b m c k|m k
A b|

Ab

a a
ab ba
abaab
abaaba
abaaba

am b n cn cm
a n a m bmc n
{0 i 1 j 0 k j i k }
{0 i 1 j 2 k j k}

0i 1j 2k | i j k}
0 j 0k 1j 2k
0k 0 j 1j 2k
0X 2 | 0 2
0X 1 |
S ABC
A 0A1|
B 1B |1
C 1 C0 |

Derivation of 0111100
S

A B
C

0 A 1 1
1 C 0

1 C 0

b b
S

b S b

a
S

b b
S

b S b

a a
S We have chosen S aSa

b b We have chosen S aSb


S

a a We have chosen S aSa


S

 S  is chosen
S

a B

a B B

b S b S

b A
b A
a
a
E E

E E
E + E *
Or
id E + E
E * E id

id id id id

i c t S e S

b i c t S a

b i c t S

b a
S

i c t S

b i c t S

i c t S e S
b

b a a

S S

A A A A

b A b A A b b A

A b A b b A A b

b a a a

(a) (b)
S

A A

b A A b

b A
a
b A

a
(c)

S S

X Y Z a a Y b b

b a
a a b a b b

Parse tree 1 Parse tree 2


E E

E E E E
+ *

id E + E id
E * E

id id
id id

(a) Parse tree 1 (b) Parse tree 2


F E

E F

E E

F _ E E _ F

a E _ F E _ F a

F a F b

b a

Parse tree 1 Parse tree 2

E F | F
{ab, baba, abbbaa} L (G)

S S

b A b A

b A A b A A

a S a a b A A

b A a a

Parse tree 1 Parse tree 2

Left derivation tree

s s

a A b a b
b s

b s
S a S|
S a Sb S.

S S

aS a S b S

a S 
SbS

  

(a) (b)

S a S|X S |
X aXXb|
S

X S

a b
X X
S

a B

a B B

a B Bb S

a S b b A

b A a

a
S S

a B a B

a B B a B B

b S b b b S

b A a B

a b
E

E * E

( E ( ( E (

E + E E + E

I I I I

I 1 I 1 I 1 b

I 0 b a

I 1

E E

E + E E * E

I + I
E * E E E

a I I I I a

a a a a
Parse tree 1 Parse tree 2
Reduced grammar

Removal of Elimination of Removal of


useless symbols  production unit production

ap

ap
S  aA
A  aaA
Dab Ea
EaC d

S  aA
A  aA a
D  ab Ea
E  a
Y
X 1 X 2 X 3 ..... X n

A X 1 X 2 X 3 .... X n
S A 0C1
A B 01 10
C CD

S A B
C

S 01 10

S AS B
A aAS
B SbS A bb

ASB

aAS

SbS aAS bb

ASB AB AS SB

aAS aA a

SbS aAS bb Sb bS b aA aS bb
P1
P1
P1
P1
P1 P2
P1 P2

P2
P2 P3
P2 P3 P3
P2 P3

P1

P1 P2

P2 P3

P3

P4 P5

P4 P5

P4 P5

P4 P4

P1
P1 P2
P2 P3
P3
P4 P4
P4

A1
A1
A1

A2
A2
A2

A1
A1

A2
A2

R1
R1
R2

R1 R2

R3
R3
R4 R3
R4

R1 R3
R1 R3

R1 R2 R4
R4 R3
R1 R3
R2
R1 R3
R1
R1
R2
R2

R1

R2 R3
R3
R 2R 3

R2

R1 R1
R4
R1 R4

R1
R2
R1
R2 R3

R2
R1 R4
R1
R2
R3
R4
R1

R1

R2

R2

R2

R3

R3

R2

R3

R1 R2 R3
R2
R3
R1
R2
R3

R1 R2
R1
R2

R1 R2
R1
R2
[S S]
A CA| becomes
A CA | 011| 1

B DB | becomes
B DB | 01

S AB
A CA
A 011 A XY
X 0
Y ZZ
Z 1
B DB
B XZ

is in GNF

is not in GNF

A 1, A 2 , A 3

Ai A jA k

Ai A jA k
A A

A A|
A

S abSb

NT t (set of NT)

S abSb S XY
X AB
Y SB
A a
B b
S aa S AA

S XY A1 A2A3

X AB A2 A4A5

Y SB A3 A 1A 5

A a A4 a

B b A5 b

Ai, Aj Ai < Aj
A1  A2A3

A2  A4A5

A3  A1A5 A3  A1 A5 Here i > j


  i.e. 3 > 1
A4  a Ai Aj

A5  b

A1

A 3  A1 A 5
 
A3  A2 A3A5 A1  A2A3

A3  A4A5A3A5

Ai A jA k

A1 A 2A 3
A2 A 4A 5
A3 A 4 A 5 A 3A 5
A4 a
A5 b
A2 A3 A4

A1 A 2A 3
A2 aA 5
A3 aA 5 A 3 A 5
A4 a
A5 b

A1 A 2A 3
A2
A1 aA 5 A 3
A1 aA 5 A 3
A2 aA 5
A3 aA 5 A 3 A 5
A4 a
A5 b

S ABA|BA|AB|AA|A|B
A aA|a
B bB|b

S A|B

S ABA|BA|AB|AA|aA|a|bB|b
A aA|a
B bB|b

S ABA|BA|AB|AA

Ai Aj,Ak

S ABA S aA BA|aBA
S BA S bBA|bA
S AB S aAB|aB
S AA S aAA|aA
S aABA|aBA|bBA|bA|aAB|aB|aAA|aA
S aA|a|bB|b
A aA|a
B bB|b

S AA|0
A SS|1

S AA|0 A1 A 2 A 2|0
A SS|1 A2 A 1 A 1|1

A1  A2 A2


Ai and Aj with i < j This is allowed.

A2  A1 A1 | 1


Ai and Aj with i > j This is not allowed.

A1
A2 A 2 A 2 A 1|0A 1|1

A2  A2A2A1 | 0A1 | 1

This is left recursion

A A | A A|
A A|
A2  A2A2A1 | 0A1 | 1

 1 2

A2 0A1A |1A |0A 1|1

A A 2 A 1 A |A 2 A 1
A2
A1
A1 A 2 A 2|0

A2
A1 0A 1 A A 2|1A A 2|0A 1 A 2|1A 2|0
A1 A2
A A
A A 2 A 1 A |A 2 A 1

A2
A 0A 1 A A 1 A |1A A 1 A |0A 1 A 1 A |1A 1 A
A 0A1A A 1|1A A 1|0A 1 A 1|1A 1

A1 0A 1 A A 2|1A A 2|0A 1 A 2|1A 2|0


A2 0A 1 A |1A |0A 1|1
A 0A 1 A A 1 A |1A A 1 A |0A 1 A 1 A |1A 1 A
A 0A 1 A A 1|1A A 1|0A 1 A 1|1A 1

A 1, A 2 , A 3
A1 A2 A3
A1 A 2A 3
A2 A 3 A 1|b
A3 A 1 A 2|a
A1 A 2A 3
A2 A 3 A 1|b
Ai A jA k

A3 A 1 A 2|a
A3
A3 A 1 A 2|a
A3 A 2 A 3 A 2|a A1 A 2A 3
A3 A 3 A 1 A 3 A 2|bA 3 A 2|a A2 A 3 A 1|b

A3  A3A1A3A2 | bA3A2 | a

left recursion

A A | A A|
A A|

A3 bA 3 A 2 A |aA

A A 1 A 3 A 2 A |A 1 A 3 A 2

A3  A3A1A3A2 | bA3A2 | a

 1 2

A3
A2
A2 A 3 A 1|b

A2 bA 3 A 2 A A 1|aA A 1|b

A2
A1
A1 A 2A 3

A1 bA 3 A 2 A A 1 A 3|aA A 1 A 3|bA 3

A1
A
A A 1 A 3 A 2 A |A 1 A 3 A 2

A bA 3 A 2 A A 1 A 3 A 3 A 2 A |aA A 1 A 3 A 1 A 3 A 2 A
|bA 3 A 3 A 2 A |bA 3 A 2 A A 1 A 3 A 3 A 2|aA A 1 A 3 A 3 A 2|bA 3 A 3 A 2
A

A1 bA 3 A 2 A A 1 A 3|aA A 1 A 3|bA 3
A2 bA 3 A 2 A A 1|aA A 1|b
A3 bA 3 A 2 A |aA
A bA 3 A 2 A A 1 A 3 A 3 A 2 A |aA A 1 A 3 A 1 A 3 A 2 A
bA 3 A 3 A 2 A |bA 3 A 2 A A 1 A 3 A 3 A 2|aA A 1 A 3 A 3 A 2|bA 3 A 3 A 2
w w

p qi r si t

2i 1

S
2i 1

n 2k w A
k 1
w 2

B C

w w w w
b
2i 1
w B A
Path

b a

A, B, C A BC
B b ,A

w 2i 1

w 2i 1 n

a i b j c k|i j k

p qi r si t

w
w p q 0r s0 t

an b n cn

pq i rs i t
pq i rs i t

q0 s0

w = aa bb cc
pqrst

a 2 bc

pq i rs i t

w = aa bb cc
pqrst

a2 b 3 c3 L

w = aa bbb ccc
p qq r ss t
L 1L 2
a

a
a

an b n

n
a n b cn

utable languages
Comp
t sensitive languag
ntex es
Co
t f r e e l anguag
tex
on Regular
e
C

language
V ij
S

id = E T

E + E
;

F id

id

Types of parser

Top-down Bottom-up
parser parser

Backtracking Predictive Shift


LR parser
parser reduce parser

SLR LALR LR
parser parser parser
aSb|bSa
a|b|
|

You might also like