CONSTRUCTOR G5.grm

Start of CONSTRUCTOR for the Grammar G5.grm Sat Apr 03 15:54:32 2004

Terminal alphabet
# 1 = #
# 2 = a
# 3 = b
# 4 = c

Nonterminal alphabet
# 5 = `T'
# 6 = `S'
# 7 = `U'
# 8 = `V'

Productions
P 1: `T' -> # `S' #
P 2: `S' -> `U' `V'
P 3: `U' -> a b
P 4: `V' -> c `V'
P 5: `V' -> c
Leftmost-set
Symbol # a b c T S U V
5.T * 0 0 0 0 0 0 0
6.S 0 * 0 0 0 0 * 0
7.U 0 * 0 0 0 0 0 0
8.V 0 0 0 * 0 0 0 0
Rightmost-set
Symbol # a b c T S U V
5.T * 0 0 0 0 0 0 0
6.S 0 0 0 * 0 0 0 *
7.U 0 0 * 0 0 0 0 0
8.V 0 0 0 * 0 0 0 *
Leftmost & rightmost sets
`T' leftmost set: `#'
`T' rightmost set: #

`S' leftmost set: `a' , `U'
`S' rightmost set: c , V

`U' leftmost set: `a'
`U' rightmost set: b

`V' leftmost set: `c'
`V' rightmost set: c , V

Precedence matrix
Symbol # a b c T S U V
1.# 0 < 0 0 0 = < 0
2.a 0 0 = 0 0 0 0 0
3.b 0 0 0 > 0 0 0 >
4.c > 0 0 < 0 0 0 =
5.T 0 0 0 0 0 0 0 0
6.S = 0 0 0 0 0 0 0
7.U 0 0 0 < 0 0 0 =
8.V > 0 0 0 0 0 0 0
The relationships of symbol #1 #:
<• a =• `S' <• `U'

The relationships of symbol #2 a:
=• b

The relationships of symbol #3 b:
•> c •> `V'

The relationships of symbol #4 c:
•> # <• c =• `V'

The relationships of symbol #5 `T':

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

The relationships of symbol #7 `U':
<• c =• `V'

The relationships of symbol #8 `V':
•> #

Grammar G5.grm is a precedence grammar
Grammar G5.grm is invertible
Semantics
Semantics file is G5.sem
#=1
a=2
b=3
c=4
P1=5 $P 1: `T' -> # `S' #
P2=6 $P 2: `S' -> `U' `V'
P3=7 $P 3: `U' -> a b
P4=8 $P 4: `V' -> c `V'
P5=9 $P 5: `V' -> c
Result tables

File Size
G5.prm 28
G5.pm 81
G5.t 180
G5.tt 100
G5.ht 1224
G5.sm 44
G5.v 396
Look at result tables
Finish of CONSTRUCTOR Sat Apr 03 15:54:32 2004

Symbol	#	a	b	c	T	S	U	V
1.#	0	<	0	0	0	=	<	0
2.a	0	0	=	0	0	0	0	0
3.b	0	0	0	>	0	0	0	>
4.c	>	0	0	<	0	0	0	=
5.T	0	0	0	0	0	0	0	0
6.S	=	0	0	0	0	0	0	0
7.U	0	0	0	<	0	0	0	=
8.V	>	0	0	0	0	0	0	0

File	Size
G5.prm	28
G5.pm	81
G5.t	180
G5.tt	100
G5.ht	1224
G5.sm	44
G5.v	396