Parser

Start of Ga33 Parser for a Word cy.Ga33 at Thu Jun 28 14:05:07 2001

Scanner started
Input program:
# a a a a a c c c c c #
Scanned program:
1 2 2 2 2 2 4 4 4 4 4 1
Scanner ended
Parser started

Stack & Word # =•a a a a a c c c c c #

Stack & Word # =•a <•a a a a c c c c c #

Stack & Word # =•a <•a <•a a a c c c c c #

Stack & Word # =•a <•a <•a <•a a c c c c c #

Stack & Word # =•a <•a <•a <•a <•a c c c c c #

Stack & Word # =•a <•a <•a <•a <•a <•c c c c c #

Stack & Word # =•a <•a <•a <•a <•a =•X4 c c c c #
Parsing tree
X4
c

Stack & Word # =•a <•a <•a <•a <•a =•X4 <•c c c c #

Stack & Word # =•a <•a <•a <•a <•a =•X4 =•X5 c c c #
Parsing tree
X5
c

Stack & Word # =•a <•a <•a <•a =•X4 c c c #
Parsing tree
X4
a X4
c
X5
c

Stack & Word # =•a <•a <•a <•a =•X4 <•c c c #

Stack & Word # =•a <•a <•a <•a =•X4 =•X5 c c #
Parsing tree
X5
c

Stack & Word # =•a <•a <•a =•X4 c c #
Parsing tree
X4
a X4
a X4
c
X5
c
X5
c

Stack & Word # =•a <•a <•a =•X4 <•c c #

Stack & Word # =•a <•a <•a =•X4 =•X5 c #
Parsing tree
X5
c

Stack & Word # =•a <•a =•X4 c #
Parsing tree
X4
a X4
a X4
a X4
c
X5
c
X5
c
X5
c

Stack & Word # =•a <•a =•X4 <•c #

Stack & Word # =•a <•a =•X4 =•X5 #
Parsing tree
X5
c

Stack & Word # =•a =•X4 #
Parsing tree
X4
a X4
a X4
a X4
a X4
c
X5
c
X5
c
X5
c
X5
c

the parsing is completed
Parsing tree
X4
a X4
a X4
a X4
a X4
c
X5
c
X5
c
X5
c
X5
c
Table of identifiers

Result tables

File Size
cy.prm 28
cy.t 220
cy.it 0
cy.kt 0
cy.pt 648
Parser ended at Thu Jun 28 14:05:07 2001