lr parsing compiler baojian hua [email protected]
TRANSCRIPT
![Page 2: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/2.jpg)
Front End
source code
abstract syntax
tree
lexical analyzer
parser
tokens
IRsemantic analyzer
![Page 3: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/3.jpg)
Parsing
The parser translates the token sequence into abstract syntax trees Token sequence:
returned from the lexer abstract syntax trees:
compiler internal data structures Must take account of the program syn
tax
![Page 4: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/4.jpg)
Conceptually
token sequence
abstract
syntax treeparser
language syntax
![Page 5: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/5.jpg)
Predicative Parsing Grammars encode enough information
on how to choose production rules, when input terminals are seen
LL(1) pros: simple, easy to implement efficient
Cons: grammar rewriting ugly
![Page 6: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/6.jpg)
Today’s Topic
Bottom-up Parsing a.k.a. shift-reduce parsing, LR parsing
This is the predominant algorithm used by automatic YACC-like parser generators YACC, bison, CUP, C#yacc, etc.
![Page 7: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/7.jpg)
Bottom-up Parsing
1 S := exp
2 exp := exp + term
3 exp := term
4 term := term * factor
5 term := factor
6 factor := ID
7 factor := INT
2 + 3 * 4
factor + 3 * 4
term + 3 * 4
exp + 3 * 4
exp + factor * 4
exp + term * 4
exp + term * factor
exp + term
exp
S
A reverse of right-most derivation!
![Page 8: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/8.jpg)
Dot notation
As a convenient notation, we will mark how much of the input we have consumed by using a • symbol
exp + 3 * 4
consumed remaining input
![Page 9: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/9.jpg)
Bottom-up Parsing2 + 3 * 4
factor + 3 * 4
term + 3 * 4
exp + 3 * 4
exp + factor * 4
exp + term * 4
exp + term * factor
exp + term
exp
S
2 + 3 * 4
factor + 3 * 4
term + 3 * 4
exp + 3 * 4
exp + factor * 4
exp + term * 4
exp + term * factor
exp + term
exp
S
![Page 10: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/10.jpg)
Another View2 + 3 * 4
+ 3 * 4
+ 3 * 4
+ 3 * 4
+ 3 * 4
3 * 4
* 4
* 4
* 4
4
2
factor
term
exp
exp +
exp + 3
exp + factor
exp + term
exp + term *
exp + term * 4
exp + term * factor
exp + term
exp
S
S := exp
exp := exp + term
exp := term
term := term * factor
term := factor
factor := ID
factor := INT
What’s the data structure of the left?
![Page 11: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/11.jpg)
Producing a rightmost derivation in reverse We do two things:
shift a token (terminal) onto the stack, or reduce the top n symbols on the stack by a
production When we reduce by a production A ::=
is on the top of the stack, pop and push A
Key problem: when to shift or reduce?
![Page 12: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/12.jpg)
Yet Another View2 + 3 * 4
+ 3 * 4
+ 3 * 4
+ 3 * 4
+ 3 * 4
2
factor
term
exp
E
T
F
2
![Page 13: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/13.jpg)
Yet Another View
E
T
F
2
2 + 3 * 4
+ 3 * 4
+ 3 * 4
+ 3 * 4
+ 3 * 4
3 * 4
* 4
* 4
* 4
2
factor
term
exp
exp +
exp + 3
exp + factor
exp + term
+
3
F
S
E
T
4
F*T
![Page 14: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/14.jpg)
A shift-reduce parser Two components:
Stack: holds the viable prefixes Input stream: holds remaining source
Four actions: shift: push token from input stream onto stack reduce: right-end ( of A := ) is at top of
stack, pop , push A accept: success error: syntax error discovered
![Page 15: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/15.jpg)
Table-driven LR(k) parsers
Parser LoopLexertokens
Stack
Action table&
GOTO table
AST
Parser Generator
Grammar
![Page 16: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/16.jpg)
An LR parser Put S on stack in state s0 Parser configuration is:
(S, s0, X1, s1, X2, s2, … Xm, sm; ai ai+1 … an $) do forever:
read ai. if (action[ai, sm] is shift s then
(S, s0, X1, s1, X2, s2, … Xm, sm, ai, s; ai+1 … an $) if (action[ai, sm] is reduce A:= then
(S, s0, X1, s1, X2, s2, … Xm-| |, sm-| |, A, s; ai ai+1 … an $)where s = goto[sm-| |, A]
if (action[ai, sm] is accept, DONE if (action[ai, sm] is error, handle error
![Page 17: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/17.jpg)
Generating LR parsers
In order to generate an LR parser, we must create the action and GOTO tables
Many different ways to do this We will start here by the simplest appr
oach, called LR(0) Left-to-right parsing, Rightmost derivatio
n, 0 lookahead
![Page 18: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/18.jpg)
Item LR(0) items have the form:
[production-with-dot] For example, X -> A B C has 4
forms of items [X := A B C ] [X := A B C ] [X := A B C ] [X := A B C ]
![Page 19: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/19.jpg)
What items mean? [X := ]
input is consistent with X := [X := ]
input is consistent with X := and we have already recognized
[X := ] input is consistent with X := and we have
already recognized
[X := ] input is consistent with X := and we can reduce
to X
![Page 20: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/20.jpg)
LR(0) Items 0: S’ ->
S$
1: S -> x S
2: S -> y
S’ -> S $S -> x SS -> y
1
S’ -> S $
4
S
S -> x S
S -> x S
S -> y
2x
S -> y 3
yy
x
action GOTO
state\symbol
x y $ S
1 s2 s3 g4
2 s2 s3 g5
3 r2 r2 r2
4 accept
5 r1 r1 r1
S -> x S
5S
![Page 21: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/21.jpg)
LR(0) Items 0: S’ ->
S$
1: S -> x S
2: S -> y
S’ -> S $S -> x SS -> y
1
S’ -> S $
4
S
S -> x S
S -> x S
S -> y
2x
S -> y 3
yy
x
action GOTO
state\symbol
x y $ S
1 s2 s3 g4
2 s2 s3 g5
3 r2 r2 r2
4 accept
5 r1 r1 r1
S -> x S
5S
x x y
11, 21, 2, 21, 2, 2, 31, 2, 2, 51, 2, 51, 4accept
x x y $ x y $ y $ $ $ $ $
![Page 22: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/22.jpg)
Another Example 0: S’ ->
S$
1: S -> (L)
2: S -> x
3: L -> S
4: L -> L, S
S’ -> S $S -> (L)S -> x
1
S’ -> S $
4
S
S -> x 2x
S -> ( L)
L -> S
L -> L, S
S -> (L)
S -> x
3(
L -> S 7S
(
x
S -> (L ) L -> L , S
S -> (L)
L -> L, S
S -> (L)
S -> x
L -> L, S
8
9
5
6
S,
)
x
(
L
![Page 23: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/23.jpg)
Another Example: LR(0) table
action gotos\t ( ) x , $ S L
1 s3 s2 g4
2 r2 r2 r2 r2 r2
3 s3 s3 g7 g5
4 accept
5 s6 s8
6 r1 r1 r1 r1 r1
7 r3 r3 r3 r3 r3
8 s3 s2 g9
9 r4 r4 r4 r4 r4
![Page 24: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/24.jpg)
LR(0) table construction Construct LR(0) Items Item Ii becomes state i Parsing actions at state i are:
[ A := a ] Ii and goto(Ii, a) = Ijthen action[i, a] = “shift j”
[ A := ] Ii and A S’then action[i, a] =“reduce by A := ”
[ S’ := S ] Ii then action[i, $] =“accept”
![Page 25: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/25.jpg)
LR(0) table construction, cont’d GOTO table for non-terminals:
GOTO[i, A] = j if GOTO(Ii, A) = Ij Empty entries are “error”
Table-driven LR-parsing algorithm: figure 4.36 on text
![Page 26: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/26.jpg)
Problems with LR(0)
For every item of the form: X -> blindly reduce to X, followed with a “g
oto” which may not miss any error, but may p
ostpone the detection of some errors try “x x y x” on our first example
Another problem with LR(0) is that some grammar may have conflicts
![Page 27: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/27.jpg)
For the 1st kind of problem 0: S’ ->
S$
1: S -> x S
2: S -> y
S’ -> S $S -> x SS -> y
1
S’ -> S $
4
S
S -> x S
S -> x S
S -> y
2x
S -> y 3
yy
x
action GOTO
state\symbol
x y $ S
1 s2 s3 g4
2 s2 s3 g5
3 r2 r2 r2
4 accept
5 r1 r1 r1
S -> x S
5S
![Page 28: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/28.jpg)
For the 2nd kind of problem 0: S -> E$
1: E -> T+E
2: E -> T
3: T -> x
S -> E $E -> T + EE -> TT -> x
1
T -> x 5
x
S -> E $
2E
E -> T +E
E -> T
3T
E -> T+ E
E -> T+E
E -> T
T -> x
4+
E -> T+E
6E
Tx
A shift-reduce conflict (on state 3)!
![Page 29: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/29.jpg)
LR(0) Parse Tableaction goto
s\t x + $ E T
1 s5 g2 g3
2 accept
3 r2 s4, r2 r2
4 s5 g6 g3
5 r3 r3 r3
6 r1 r1 r1Similar reason for this problem: the “reduce” action should NOT be filled into (3, +).
![Page 30: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/30.jpg)
SLR table construction Construct LR(0) Items Item Ii becomes state i Parsing actions at state i are:
[ A := a ] Ii and goto(Ii, a) = Ijthen action[i,a] = “shift j”
[ A := ] Ii and A S’then action[i,a] =“reduce by A := ”
only for all a FOLLOW(A) [ S’ := S ] Ii
then action[i,$] =“accept” GOTO table as before
![Page 31: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/31.jpg)
Follow set 0: S -> E$
1: E -> T+E
2: E -> T
3: T -> x
S -> E $E -> T + EE -> TT -> x
1
T -> x 5
x
S -> E $
2E
E -> T +E
E -> T
3T
E -> T+ E
E -> T+E
E -> T
T -> x
4+
E -> T+E
6E
Tx
Follow (E) = {$}
Follow (T) = {+, $}
![Page 32: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/32.jpg)
LR(0) Table with Followaction goto
s\t x + $ E T
1 s5 g2 g3
2 accept
3 r2 s4, r2 r2
4 s5 g6 g3
5 r3 r3 r3
6 r1 r1 r1
![Page 33: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/33.jpg)
Problems with SLR
For every item of the form: X -> only reduce when the next token t\in Foll
ow(X) sometimes, this resolves conflicts such a
s shift-reduce presented above However, there exist conflicts that can
NOT be resolved by SLR
![Page 34: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/34.jpg)
Problems with SLR
S’ := S$
S := L = R
| R
L := * R
| id
R := L
S’ := S $S := L = RS := RL := *RL := idR := L
0
S’ := S $1
S := L = RR := L
2
S := R 3
L := * RR := LL := *RL := id
4
L := id 5
S := L = RR := LL := *RL := id
6
L := * R 7
R := L 8
S := L = R 9
R
L
id
*
* R
L
L
=
S
![Page 35: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/35.jpg)
Problems with SLR Reduce on ALL terminals in FOLLOW set
FOLLOW(R) = FOLLOW(L) Especially, we have ‘=‘ \in FOLLOW(R)
Thus, there exists shift-reduce conflict in state 2 Why this happen and how to solve this?
S := L = R
| R
L := * R
| id
R := L
S := L = RR := L
2
![Page 36: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/36.jpg)
LR(1) Items [X := , a] means
is at top of stack Input string is derivable from a
In other words, when we reduce X := , a had better be the look ahead symbol.
Or, put ‘reduce by X := ’ in action[s, a] only
![Page 37: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/37.jpg)
LR(1) table construction Construct LR(1) Items Item Ii becomes state i Parsing actions at state i are:
[ A := a ,b] Ii and goto(Ii, a) = Ijthen action[i, a] = “shift j”
[ A := ,b] Ii and A S’then action[i, a] =“reduce by A := ” for b
[ S’ := S ,$] Ii then action[i, $] =“accept”
GOTO table as before Initial state is from Item containing [S’ := S ,$]
![Page 38: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/38.jpg)
LR(1) Items (part)
S’ := S$
S := L = R
| R
L := * R
| id
R := L
S’ := S ,$S := L = R,$S := R ,$L := *R ,=/$L := id ,=/$R := L ,$
0
S’ := S ,$
1
S := L= R ,$R := L ,$
2
L
![Page 39: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/39.jpg)
S := L = R
| R
L := * R
| id
R := L
S’ := S ,$S := L = R ,$S := R ,$L := *R ,=/$L := id ,=/$R := L ,$
0
S’ := S ,$
1
S := L = R ,$R := L ,$
2
S := R ,$3
L := * R ,=/$R := L ,=/$L := *R ,=/$L := id ,=/$
4
L := id ,=/$5
S := L = R ,$R := L ,$L := *R ,$L := id ,$
6
L := *R ,=/$7
R := L ,=/$8
S := L = R ,$9
R
Lid
*
*R
L
More
R := L ,$10
L := id ,$11
others
![Page 40: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/40.jpg)
S := L = R
| R
L := * R
| id
R := L
S’ := S ,$S := L = R ,$S := R ,$L := *R ,=/$L := id ,=/$R := L ,$
0
S’ := S ,$
1
S := L = R ,$R := L ,$
2
S := R ,$3
L := * R ,=/$R := L ,=/$L := *R ,=/$L := id ,=/$
4
L := id ,=/$5
S := L = R ,$R := L ,$L := *R ,$L := id ,$
6
L := *R ,=/$7
R := L ,=/$8
S := L = R ,$9
R
Lid
*
*R
L
Notice similar states?
R := L ,$10
L := id ,$11
others
![Page 41: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/41.jpg)
S := L = R
| R
L := * R
| id
R := L
S’ := S ,$S := L = R ,$S := R ,$L := *R ,=/$L := id ,=/$R := L ,$
0
S’ := S ,$
1
S := L = R ,$R := L ,$
2
S := R ,$3
L := * R ,=/$R := L ,=/$L := *R ,=/$L := id ,=/$
4
L := id ,=/$5
S := L = R ,$R := L ,$L := *R ,$L := id ,$
6
L := *R ,=/$7
R := L ,=/$8
S := L = R ,$9
R
Lid
*
*R
L
Notice similar states?
R := L ,$10
L := id ,$11
others
![Page 42: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/42.jpg)
LALR Construction
Merge items with common cores Change GOTO table to reflect
merges Can introduce reduce/reduce
conflicts Cannot introduce shift/reduce
conflicts
![Page 43: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/43.jpg)
S := L = R
| R
L := * R
| id
R := L
S’ := S ,$S := L = R ,$S := R ,$L := *R ,=/$L := id ,=/$R := L ,$
0
S’ := S ,$
1
S := L = R ,$R := L ,$
2
S := R ,$3
L := * R ,=/$R := L ,=/$L := *R ,=/$L := id ,=/$
4
L := id ,=/$5
S := L = R ,$R := L ,$L := *R ,$L := id ,$
6
L := *R ,=/$7
R := L ,=/$8
S := L = R ,$9
R
Lid
*
*R
L
LALR
R := L ,$10
L := id ,$11
others
![Page 44: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/44.jpg)
Ambiguous Grammars No ambiguous grammars can be LR(k)
hence can not be parsed bottom-up Nevertheless, some of the ambiguous
grammar are well-understood, and can be parsed by LR(k) with some tricks precedence associativity dangling-else
![Page 45: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/45.jpg)
Precedence E := E*E
| E+E
| idS’ := E $
E := E * E
E := E + E
E := id
S’ := E $
E := E * E
E := E + E
E := E * E
E := E * E
E := E + E
E := id
E := E + E
E := E * E
E := E + E
E := id
E := E * E
E := E * E
E := E + E
E := E + E
E := E * E
E := E + Es/r on both * and +
E
![Page 46: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/46.jpg)
Precedence E := E*E
| E+E
| idS’ := E $
E := E * E
E := E + E
E := id
S’ := E $
E := E * E
E := E + E
E := E * E
E := E * E
E := E + E
E := id
E := E + E
E := E * E
E := E + E
E := id
E := E * E
E := E * E
E := E + E
E := E + E
E := E * E
E := E + E
reduce on +shift on *
E
reduce on +reduce on *
What if we want both + and *right-associative?
![Page 47: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/47.jpg)
Parser Implementation Implementation Options:
Write a parser by hand, from scratch not as boring as writing a lexer recall the dragon compiler
Use an automatic parser generator Very general & robust. sometimes not quite as efficien
t as hand-written parsers. good for rapid prototyping.
Both are used extensively in production compilers
![Page 48: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/48.jpg)
Yacc Tool semantic
analyzer specification
parser
Yacc
Creates a parser from a declarative specification involving a context-free grammar
![Page 49: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/49.jpg)
Brief History YACC stands for Yet Another Compiler-Com
piler It was first developed by Steve Johnson in 1
975 for Unix There have been many later versions of YAC
C (e.g., GNU Bison), each offering minor improvements
Ported to many languages YACC is now a standard tool, defined in IEEE
Posix standard P1003.2
![Page 50: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/50.jpg)
YaccUser code and Yacc decleartions: declare values a
vailable in the rule actions
%%
Grammar rules: parser specified by CFG rules and associated semantic action that generate abstract syntax
%%
User code: other code
![Page 51: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/51.jpg)
ML-Yacc Definitions (preliminaries) Specify type of positions
%pos int * int Specify terminal and nonterminal symbols
%term IF | THEN | ELSE | PLUS | MINUS ...%nonterm prog | exp | stm
Specify end-of-parse token%eop EOF
Specify start symbol (by default, non terminal in LHS of first rule)
%start prog
![Page 52: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/52.jpg)
Example%%%term ASSIGN | ID | PLUS |NUM | SEMICOLON | TIMES%nonterm s | e%pos int %start p %eop EOF%left PLUS%left TIMES
%%p -> s SEMICOLON p () -> ()s -> ID ASSIGN e ()e -> e PLUS e () | e TIMES e () | ID () | NUM ()
![Page 53: LR Parsing Compiler Baojian Hua bjhua@ustc.edu.cn](https://reader035.vdocuments.mx/reader035/viewer/2022062217/56649e585503460f94b523be/html5/thumbnails/53.jpg)
Summary
Bottom-up parsing reverse order of derivations
LR grammars are more powerful use of stacks and parse tables yet more complex Bonus: tools do the hard work for you, re
ad the online Yacc manual