Start of CONSTRUCTOR for the Grammar G101.grm Sat Apr 03 15:42:28 2004

Terminal alphabet

# 1 = #
# 2 = a
# 3 = b
# 4 = 1
# 5 = 0

Nonterminal alphabet

# 6 = `T'
# 7 = `S'
# 8 = `A'
# 9 = `B'
#10 = `E'
#11 = `C'
#12 = `F'
#13 = `D'

Productions

P 1: `T' -> # `S' #
P 2: `S' -> a `A'
P 3: `S' -> b `B'
P 4: `A' -> `E' `A' 1
P 5: `A' -> 0 1
P 6: `B' -> `C' 1
P 7: `C' -> `F' `B' 1
P 8: `B' -> `D' 1
P 9: `D' -> 0 1

Leftmost-set

Symbol#ab10TSABECFD
6.T*000000000000
7.S0**0000000000
8.A0000*0000*000
9.B0000*00000***
10.E0000000000000
11.C00000000000*0
12.F0000000000000
13.D0000*00000000

Rightmost-set

Symbol#ab10TSABECFD
6.T*000000000000
7.S000*000**0000
8.A000*000000000
9.B000*000000000
10.E0000000000000
11.C000*000000000
12.F0000000000000
13.D000*000000000

Leftmost & rightmost sets

`T' leftmost set: `#'
`T' rightmost set: #

`S' leftmost set: `a' , `b'
`S' rightmost set: 1 , A , B

`A' leftmost set: `0' , `E'
`A' rightmost set: 1

`B' leftmost set: `0' , `C' , `F' , `D'
`B' rightmost set: 1

`E' leftmost set:
`E' rightmost set:

`C' leftmost set: `F'
`C' rightmost set: 1

`F' leftmost set:
`F' rightmost set:

`D' leftmost set: `0'
`D' rightmost set: 1

Precedence matrix

Symbol#ab10TSABECFD
1.#0<<000=000000
2.a0000<00=0<000
3.b0000<000=0<<<
4.1>00>000000000
5.0000=000000000
6.T0000000000000
7.S=000000000000
8.A>00=000000000
9.B>00=000000000
10.E0000<00=0<000
11.C000=000000000
12.F0000<000=0<<<
13.D000=000000000
The relationships of symbol #1 #:
<• a<• b=• `S'

The relationships of symbol #2 a:
<• 0=• `A'<• `E'

The relationships of symbol #3 b:
<• 0=• `B'<• `C'<• `F'<• `D'

The relationships of symbol #4 1:
•> #•> 1

The relationships of symbol #5 0:
=• 1

The relationships of symbol #6 `T':

The relationships of symbol #7 `S':
=• #

The relationships of symbol #8 `A':
•> #=• 1

The relationships of symbol #9 `B':
•> #=• 1

The relationships of symbol #10 `E':
<• 0=• `A'<• `E'

The relationships of symbol #11 `C':
=• 1

The relationships of symbol #12 `F':
<• 0=• `B'<• `C'<• `F'<• `D'

The relationships of symbol #13 `D':
=• 1

Grammar G101.grm is a precedence grammar

Grammar G101.grm is not invertible

Left Context


Symbol#ab10TSABECFD
6.T0000000000000
7.S*000000000000
8.A0*0000000*000
9.B00*00000000*0
10.E0*0000000*000
11.C00*00000000*0
12.F00*00000000*0
13.D00*00000000*0

Right Context


Symbol#ab10
6.T00000
7.S*0000
8.A*00*0
9.B*00*0
10.E0000*
11.C000*0
12.F0000*
13.D000*0


Independent context

`T' left context:
`T' right context:

`S' left context: #
`S' right context: #

`A' left context: a , `E'
`A' right context: # , 1

`B' left context: b , `F'
`B' right context: # , 1

`E' left context: a , `E'
`E' right context: 0

`C' left context: b , `F'
`C' right context: 1

`F' left context: b , `F'
`F' right context: 0

`D' left context: b , `F'
`D' right context: 1

Equivalent definitions:
`A' —> 0 1 & `D' —> 0 1
`A' left context: a , `E'
`A' right context: # , 1

`D' left context: b , `F'
`D' right context: 1


The left context of `A' and `D' is different

Grammar G101.grm is BRC(1|1)-reducible

Semantics

Semantics file is G101.sem
#=1
a=2
b=3
1=4
0=5
P1=6 $P 1: `T' -> # `S' #
P2=7 $P 2: `S' -> a `A'
P3=8 $P 3: `S' -> b `B'
P4=9 $P 4: `A' -> `E' `A' 1
P5=10 $P 5: `A' -> 0 1
P6=11 $P 6: `B' -> `C' 1
P7=12 $P 7: `C' -> `F' `B' 1
P8=13 $P 8: `B' -> `D' 1
P9=14 $P 9: `D' -> 0 1

Result tables


FileSize
G101.prm28
G101.pm196
G101.t280
G101.tt120
G101.ht1396
G101.sm64
G101.v680
G101.lc196
G101.rc196
Look at result tables

Finish of CONSTRUCTOR Sat Apr 03 15:42:28 2004