Start of CONSTRUCTOR for the Grammar G29.grm Sat Apr 03 15:51:50 2004

Terminal alphabet

# 1 = #
# 2 = n
# 3 = x
# 4 = b
# 5 = c
# 6 = d
# 7 = e
# 8 = f


Nonterminal alphabet

# 9 = `S'
#10 = `N'
#11 = `A'


Productions

P 1: `S' -> # `N' #
P 2: `N' -> `A'
P 3: `N' -> n `A'
P 4: `A' -> x
P 5: `A' -> b
P 6: `A' -> c
P 7: `A' -> d
P 8: `A' -> e
P 9: `A' -> f

Leftmost-set

Symbol#nxbcdefSNA
9.S*0000000000
10.N0*******00*
11.A00******000

Rightmost-set

Symbol#nxbcdefSNA
9.S*0000000000
10.N00******00*
11.A00******000

Leftmost & rightmost sets

`S' leftmost set: `#'
`S' rightmost set: #

`N' leftmost set: `n' , `x' , `b' , `c' , `d' , `e' , `f' , `A'
`N' rightmost set: x , b , c , d , e , f , A

`A' leftmost set: `x' , `b' , `c' , `d' , `e' , `f'
`A' rightmost set: x , b , c , d , e , f


Precedence matrix

Symbol#nxbcdefSNA
1.#0<<<<<<<0=<
2.n00<<<<<<00=
3.x>0000000000
4.b>0000000000
5.c>0000000000
6.d>0000000000
7.e>0000000000
8.f>0000000000
9.S00000000000
10.N=0000000000
11.A>0000000000

The relationships of symbol #1 #:
<• n<• x<• b<• c<• d<• e<• f=• `N'<• `A'

The relationships of symbol #2 n:
<• x<• b<• c<• d<• e<• f=• `A'

The relationships of symbol #3 x:
•> #

The relationships of symbol #4 b:
•> #

The relationships of symbol #5 c:
•> #

The relationships of symbol #6 d:
•> #

The relationships of symbol #7 e:
•> #

The relationships of symbol #8 f:
•> #

The relationships of symbol #9 `S':

The relationships of symbol #10 `N':
=• #

The relationships of symbol #11 `A':
•> #


Grammar G29.grm is a precedence grammar

Grammar G29.grm is invertible


Semantics

Semantics file is G29.sem
#=1
n=2
x=3
b=4
c=5
d=6
e=7
f=8
P1=9 $P 1: `S' -> # `N' #
P2=10 $P 2: `N' -> `A'
P3=11 $P 3: `N' -> n `A'
P4=12 $P 4: `A' -> x
P5=13 $P 5: `A' -> b
P6=14 $P 6: `A' -> c
P7=15 $P 7: `A' -> d
P8=16 $P 8: `A' -> e
P9=17 $P 9: `A' -> f

Result tables


FileSize
G29.prm28
G29.pm144
G29.t240
G29.tt180
G29.ht1360
G29.sm76
G29.v580

Look at result tables

Finish of CONSTRUCTOR Sat Apr 03 15:51:50 2004