Start of CONSTRUCTOR for the Grammar G1.grm Sat Apr 03 15:39:57 2004
Terminal alphabet
# 1 = #
# 2 = a
# 3 = b
Nonterminal alphabet
# 4 = `S'
# 5 = `A'
# 6 = `B'
# 7 = `C'
Productions
P 1: `S' -> # `A' #
P 2: `A' -> `B' `C'
P 3: `B' -> a
P 4: `B' -> `B' a
P 5: `C' -> b
Leftmost-set
| Symbol | # | a | b | S | A | B | C |
| 4.S | * | 0 | 0 | 0 | 0 | 0 | 0 |
| 5.A | 0 | * | 0 | 0 | 0 | * | 0 |
| 6.B | 0 | * | 0 | 0 | 0 | * | 0 |
| 7.C | 0 | 0 | * | 0 | 0 | 0 | 0 |
Rightmost-set
| Symbol | # | a | b | S | A | B | C |
| 4.S | * | 0 | 0 | 0 | 0 | 0 | 0 |
| 5.A | 0 | 0 | * | 0 | 0 | 0 | * |
| 6.B | 0 | * | 0 | 0 | 0 | 0 | 0 |
| 7.C | 0 | 0 | * | 0 | 0 | 0 | 0 |
Leftmost & rightmost sets
`S' leftmost set: `#'
`S' rightmost set: #
`A' leftmost set: `a' , `B'
`A' rightmost set: b , C
`B' leftmost set: `a' , `B'
`B' rightmost set: a
`C' leftmost set: `b'
`C' rightmost set: b
Precedence matrix
| Symbol | # | a | b | S | A | B | C |
| 1.# | 0 | < | 0 | 0 | = | < | 0 |
| 2.a | 0 | > | > | 0 | 0 | 0 | > |
| 3.b | > | 0 | 0 | 0 | 0 | 0 | 0 |
| 4.S | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 5.A | = | 0 | 0 | 0 | 0 | 0 | 0 |
| 6.B | 0 | = | < | 0 | 0 | 0 | = |
| 7.C | > | 0 | 0 | 0 | 0 | 0 | 0 |
The relationships of symbol #1 #:
The relationships of symbol #2 a:
The relationships of symbol #3 b:
The relationships of symbol #4 `S':
The relationships of symbol #5 `A':
The relationships of symbol #6 `B':
The relationships of symbol #7 `C':
Grammar G1.grm is a precedence grammar
Grammar G1.grm is invertible
Semantics
Semantics file is G1.sem
#=1
a=2
b=3
P1=4 $P 1: `S' -> # `A' #
P2=5 $P 2: `A' -> `B' `C'
P3=6 $P 3: `B' -> a
P4=7 $P 4: `B' -> `B' a
P5=8 $P 5: `C' -> b
Result tables
| File | Size |
| G1.prm | 28 |
| G1.pm | 64 |
| G1.t | 160 |
| G1.tt | 80 |
| G1.ht | 1220 |
| G1.sm | 40 |
| G1.v | 360 |
Look at result tablesFinish of CONSTRUCTOR Sat Apr 03 15:39:57 2004