Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- Starting parse
- Entering state 0
- Reducing stack by rule 3 (line 99):
- -> $$ = nterm assignments (:1.1: )
- Stack now 0
- Entering state 2
- Reading a token: yylex returning 1000
- Next token is token "identifier" (:1.1: three)
- Shifting token "identifier" (:1.1: three)
- Entering state 4
- Reading a token: yylex returning 61
- Next token is token '=' (:1.1: )
- Shifting token '=' (:1.1: )
- Entering state 8
- Reading a token: yylex returning 5000
- Next token is token "integer-const" (:1.1: 3)
- Shifting token "integer-const" (:1.1: 3)
- Entering state 5
- Reducing stack by rule 10 (line 112):
- $1 = token "integer-const" (:1.1: 3)
- -> $$ = nterm exp (:1.1: 3)
- Stack now 0 2 4 8
- Entering state 14
- Reading a token: yylex returning 1000
- Next token is token "identifier" (:1.1: seven)
- Reducing stack by rule 4 (line 102):
- $1 = token "identifier" (:1.1: three)
- $2 = token '=' (:1.1: )
- $3 = nterm exp (:1.1: 3)
- -> $$ = nterm assignment (:1.1: )
- Stack now 0 2
- Entering state 6
- Reducing stack by rule 2 (line 98):
- $1 = nterm assignments (:1.1: )
- $2 = nterm assignment (:1.1: )
- -> $$ = nterm assignments (:1.1: )
- Stack now 0
- Entering state 2
- Next token is token "identifier" (:1.1: seven)
- Shifting token "identifier" (:1.1: seven)
- Entering state 4
- Reading a token: yylex returning 61
- Next token is token '=' (:1.1: )
- Shifting token '=' (:1.1: )
- Entering state 8
- Reading a token: yylex returning 5000
- Next token is token "integer-const" (:1.1: 1)
- Shifting token "integer-const" (:1.1: 1)
- Entering state 5
- Reducing stack by rule 10 (line 112):
- $1 = token "integer-const" (:1.1: 1)
- -> $$ = nterm exp (:1.1: 1)
- Stack now 0 2 4 8
- Entering state 14
- Reading a token: yylex returning 43
- Next token is token '+' (:1.1: )
- Shifting token '+' (:1.1: )
- Entering state 9
- Reading a token: yylex returning 5000
- Next token is token "integer-const" (:1.1: 2)
- Shifting token "integer-const" (:1.1: 2)
- Entering state 5
- Reducing stack by rule 10 (line 112):
- $1 = token "integer-const" (:1.1: 2)
- -> $$ = nterm exp (:1.1: 2)
- Stack now 0 2 4 8 14 9
- Entering state 15
- Reading a token: yylex returning 42
- Next token is token '*' (:1.1: )
- Shifting token '*' (:1.1: )
- Entering state 11
- Reading a token: yylex returning 1000
- Next token is token "identifier" (:1.1: three)
- Shifting token "identifier" (:1.1: three)
- Entering state 13
- Reducing stack by rule 9 (line 111):
- $1 = token "identifier" (:1.1: three)
- -> $$ = nterm exp (:1.1: 3)
- Stack now 0 2 4 8 14 9 15 11
- Entering state 17
- Reducing stack by rule 7 (line 109):
- $1 = nterm exp (:1.1: 2)
- $2 = token '*' (:1.1: )
- $3 = nterm exp (:1.1: 3)
- -> $$ = nterm exp (:1.1: 6)
- Stack now 0 2 4 8 14 9
- Entering state 15
- Reading a token: yylex returning 1000
- Next token is token "identifier" (:1.1: seven)
- Reducing stack by rule 5 (line 107):
- $1 = nterm exp (:1.1: 1)
- $2 = token '+' (:1.1: )
- $3 = nterm exp (:1.1: 6)
- -> $$ = nterm exp (:1.1: 7)
- Stack now 0 2 4 8
- Entering state 14
- Next token is token "identifier" (:1.1: seven)
- Reducing stack by rule 4 (line 102):
- $1 = token "identifier" (:1.1: seven)
- $2 = token '=' (:1.1: )
- $3 = nterm exp (:1.1: 7)
- -> $$ = nterm assignment (:1.1: )
- Stack now 0 2
- Entering state 6
- Reducing stack by rule 2 (line 98):
- $1 = nterm assignments (:1.1: )
- $2 = nterm assignment (:1.1: )
- -> $$ = nterm assignments (:1.1: )
- Stack now 0
- Entering state 2
- Next token is token "identifier" (:1.1: seven)
- Shifting token "identifier" (:1.1: seven)
- Entering state 4
- Reading a token: yylex returning 42
- Next token is token '*' (:1.1: )
- Reducing stack by rule 9 (line 111):
- $1 = token "identifier" (:1.1: seven)
- -> $$ = nterm exp (:1.1: 7)
- Stack now 0 2
- Entering state 7
- Next token is token '*' (:1.1: )
- Shifting token '*' (:1.1: )
- Entering state 11
- Reading a token: yylex returning 1000
- Next token is token "identifier" (:1.1: seven)
- Shifting token "identifier" (:1.1: seven)
- Entering state 13
- Reducing stack by rule 9 (line 111):
- $1 = token "identifier" (:1.1: seven)
- -> $$ = nterm exp (:1.1: 7)
- Stack now 0 2 7 11
- Entering state 17
- Reducing stack by rule 7 (line 109):
- $1 = nterm exp (:1.1: 7)
- $2 = token '*' (:1.1: )
- $3 = nterm exp (:1.1: 7)
- -> $$ = nterm exp (:1.1: 49)
- Stack now 0 2
- Entering state 7
- Reading a token: yylex returning 0
- Now at end of input.
- Reducing stack by rule 1 (line 96):
- $1 = nterm assignments (:1.1: )
- $2 = nterm exp (:1.1: 49)
- -> $$ = nterm unit (:1.1: )
- Stack now 0
- Entering state 1
- Now at end of input.
- Shifting token "end of file" (:1.1: )
- Entering state 3
- Cleanup: popping token "end of file" (:1.1: )
- Cleanup: popping nterm unit (:1.1: )
- result: 49
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement