Start of Parser for a Word Ga332.wrd of the language Ga33.grm at Sun Jan 14 15:33:04 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 #
Pointer to top_a

Stack & Word # =•a <•a a a a c c c c c #
Pointer to top_aa

Stack & Word # =•a <•a <•a a a c c c c c #
Pointer to top_aaa

Stack & Word # =•a <•a <•a <•a a c c c c c #
Pointer to top_aaaa

Stack & Word # =•a <•a <•a <•a <•a c c c c c #
Pointer to top_aaaaa

Stack & Word # =•a <•a <•a <•a <•a <•c c c c c #
Pointer to top_aaaaac


Stack & Word # =•a <•a <•a <•a <•a =•X4 c c c c #
Pointer to top_aaaaaX4

Parsing tree

X4
c


Stack & Word # =•a <•a <•a <•a <•a =•X4 <•c c c c #
Pointer to top_aaaaaX4c


Stack & Word # =•a <•a <•a <•a <•a =•X4 =•X5 c c c #
Pointer to top_aaaaaX4X5

Parsing tree

X5
c



Stack & Word # =•a <•a <•a <•a =•X4 c c c #
Pointer to top_aaaaX4

Parsing tree

X4
aX4
c
X5
c


Stack & Word # =•a <•a <•a <•a =•X4 <•c c c #
Pointer to top_aaaaX4c


Stack & Word # =•a <•a <•a <•a =•X4 =•X5 c c #
Pointer to top_aaaaX4X5

Parsing tree

X5
c



Stack & Word # =•a <•a <•a =•X4 c c #
Pointer to top_aaaX4

Parsing tree

X4
aX4
aX4
c
X5
c
X5
c


Stack & Word # =•a <•a <•a =•X4 <•c c #
Pointer to top_aaaX4c


Stack & Word # =•a <•a <•a =•X4 =•X5 c #
Pointer to top_aaaX4X5

Parsing tree

X5
c



Stack & Word # =•a <•a =•X4 c #
Pointer to top_aaX4

Parsing tree

X4
aX4
aX4
aX4
c
X5
c
X5
c
X5
c


Stack & Word # =•a <•a =•X4 <•c #
Pointer to top_aaX4c


Stack & Word # =•a <•a =•X4 =•X5 #
Pointer to top_aaX4X5

Parsing tree

X5
c



Stack & Word # =•a =•X4 #
Pointer to top_aX4

Parsing tree

X4
aX4
aX4
aX4
aX4
c
X5
c
X5
c
X5
c
X5
c

the parsing is complete

Parser ended at Sun Jan 14 15:33:04 2001