python/o
arithExpr --- begin test --------------------------------
grammar source, ('s=s+p', 's = p', "p = p '*' i", 'p = i', "i = '(' s \t\t ')'", "i = '0'", "i = '1'", "i = '2'")
dbg: prdGen, 4, rounds
dbg: gen lrK, 1
test begin arithExpr 0 input: 2 --------------------------------
parsed s@0 from 1 tokens, 7 steps, 17 states, Rules 11
2 s@0 s@2 p@3 p@5 i@6 i@10 ==2
test begin arithExpr 1 input: 1 + 2 * 0 --------------------------------
parsed s@0 from 5 tokens, 21 steps, 17 states, Rules 11
1 s@0 s@1 s@0 s@2 p@3 p@5 i@6 i@9 ==1
+ ==+
2 p@3 p@4 p@3 p@5 i@6 i@10 ==2
* ==*
0 i@6 i@8 ==0
test begin arithExpr 2 input: 2 * ( 1 * 2 + 0 ) --------------------------------
parsed s@0 from 9 tokens, 35 steps, 17 states, Rules 11
2 s@0 s@2 p@3 p@4 p@3 p@5 i@6 i@10 ==2
* ==*
( i@6 i@7 ==(
1 s@0 s@1 s@0 s@2 p@3 p@4 p@3 p@5 i@6 i@9 ==1
* ==*
2 i@6 i@10 ==2
+ ==+
0 p@3 p@5 i@6 i@8 ==0
) ==)
test begin arithExpr 3 input: 1 + 2 ( --------------------------------
dbg: syntax after 2 tokenNr 2 expected: !, ), *, +, not lah: ( !
syntax test arithExpr 3 : syntax after 2 tokenNr 2 expected: !, ), *, +, not lah: ( !
input 1 + 2 (
test begin arithExpr 4 input: 1 + 2 + --------------------------------
dbg: syntax after + tokenNr 3 expected: (, 0, 1, 2, not lah: !
syntax test arithExpr 4 : syntax after + tokenNr 3 expected: (, 0, 1, 2, not lah: !
input 1 + 2 +
arithExprPM --- begin test --------------------------------
grammar source, ('s=s pm p', 's=p', 'p=p*i', 'p=p/i', 'p=i', 'i=( s )', 'i = j', 'j=epm d', 'j=j d', 'epm = pm epm', 'epm = ', 'pm=+', 'pm=-', 'd=0', 'd=1', 'd = 2 ')
dbg: prdGen, 4, rounds
dbg: gen lrK, 1
test begin arithExprPM 0 input: 2 --------------------------------
parsed s@0 from 1 tokens, 13 steps, 31 states, Rules 23
s@0 s@2 p@3 p@6 i@7 i@9 j@10 j@11 epm@13 epm@15 ==emptyRule
2 d@19 d@22 ==2
test begin arithExprPM 1 input: 1 + 2 * 0 --------------------------------
parsed s@0 from 5 tokens, 41 steps, 31 states, Rules 23
s@0 s@1 s@0 s@2 p@3 p@6 i@7 i@9 j@10 j@11 epm@13 epm@15 ==emptyRule
1 d@19 d@21 ==1
+ pm@16 pm@17 ==+
p@3 p@4 p@3 p@6 i@7 i@9 j@10 j@11 epm@13 epm@15 ==emptyRule
2 d@19 d@22 ==2
* ==*
i@7 i@9 j@10 j@11 epm@13 epm@15 ==emptyRule
0 d@19 d@20 ==0
test begin arithExprPM 2 input: 2 * ( 1 * 2 + 0 ) --------------------------------
parsed s@0 from 9 tokens, 61 steps, 31 states, Rules 23
s@0 s@2 p@3 p@4 p@3 p@6 i@7 i@9 j@10 j@11 epm@13 epm@15 ==emptyRule
2 d@19 d@22 ==2
* ==*
( i@7 i@8 ==(
s@0 s@1 s@0 s@2 p@3 p@4 p@3 p@6 i@7 i@9 j@10 j@11 epm@13 epm@15 ==emptyRule
1 d@19 d@21 ==1
* ==*
i@7 i@9 j@10 j@11 epm@13 epm@15 ==emptyRule
2 d@19 d@22 ==2
+ pm@16 pm@17 ==+
p@3 p@6 i@7 i@9 j@10 j@11 epm@13 epm@15 ==emptyRule
0 d@19 d@20 ==0
) ==)
test begin arithExprPM 3 input: 1 + 2 ( --------------------------------
dbg: syntax after 2 tokenNr 2 expected: !, ), *, +, -, /, 0, 1, 2, not lah: ( !
syntax test arithExprPM 3 : syntax after 2 tokenNr 2 expected: !, ), *, +, -, /, 0, 1, 2, not lah: ( !
input 1 + 2 (
test begin arithExprPM 4 input: 1 + 2 + --------------------------------
dbg: syntax after + tokenNr 3 expected: (, +, -, 0, 1, 2, not lah: !
syntax test arithExprPM 4 : syntax after + tokenNr 3 expected: (, +, -, 0, 1, 2, not lah: !
input 1 + 2 +
test begin arithExprPM 5 input: 1 0 / - - 1 1 + + - 1 2 / ( 1 - - 2 / + 0 ) --------------------------------
parsed s@0 from 22 tokens, 134 steps, 31 states, Rules 23
s@0 s@1 s@0 s@2 p@3 p@5 p@3 p@6 i@7 i@9 j@10 j@12 j@10 j@11 epm@13 epm@15 ==emptyRule
1 d@19 d@21 ==1
0 d@19 d@20 ==0
/ ==/
- i@7 i@9 j@10 j@12 j@10 j@11 epm@13 epm@14 pm@16 pm@18 ==-
- epm@13 epm@14 pm@16 pm@18 ==-
epm@13 epm@15 ==emptyRule
1 d@19 d@21 ==1
1 d@19 d@21 ==1
+ pm@16 pm@17 ==+
+ p@3 p@5 p@3 p@6 i@7 i@9 j@10 j@12 j@10 j@11 epm@13 epm@14 pm@16 pm@17 ==+
- epm@13 epm@14 pm@16 pm@18 ==-
epm@13 epm@15 ==emptyRule
1 d@19 d@21 ==1
2 d@19 d@22 ==2
/ ==/
( i@7 i@8 ==(
s@0 s@1 s@0 s@2 p@3 p@6 i@7 i@9 j@10 j@11 epm@13 epm@15 ==emptyRule
1 d@19 d@21 ==1
- pm@16 pm@18 ==-
- p@3 p@5 p@3 p@6 i@7 i@9 j@10 j@11 epm@13 epm@14 pm@16 pm@18 ==-
epm@13 epm@15 ==emptyRule
2 d@19 d@22 ==2
/ ==/
+ i@7 i@9 j@10 j@11 epm@13 epm@14 pm@16 pm@17 ==+
epm@13 epm@15 ==emptyRule
0 d@19 d@20 ==0
) ==)
test begin arithExprPM 6 input: - - 2 * * + + 1 * * - 2 * 1 + 0 --------------------------------
dbg: syntax after * tokenNr 3 expected: (, +, -, 0, 1, 2, not lah: * 1 + 0 !
syntax test arithExprPM 6 : syntax after * tokenNr 3 expected: (, +, -, 0, 1, 2, not lah: * 1 + 0 !
input - - 2 * * + + 1 * * - 2 * 1 + 0
arithExprPE --- begin test --------------------------------
grammar source, ('s=s pm p', 's=p', 'p=p*e', 'p=p/e', 'p=e', 'e=i', 'e=i**e', 'i=( s )', ' i=j', 'j=epm d', 'j=j d', 'epm = pm epm', 'epm = ', 'pm=+', 'pm=-', 'd=0', 'd=1', 'd = 2 ')
dbg: prdGen, 4, rounds
dbg: gen lrK, 1
dbg: goFix conflict in s11{pa={e@8#1, e@9#1}}, lah=*, to=e@8, s12{pa={e@9#2}}
dbg: gen lrK, 2
dbg: prdGen, 4, rounds
test begin arithExprPE 0 input: 2 --------------------------------
parsed s@0 from 1 tokens, 15 steps, 36 states, Rules 26
s@0 s@2 p@3 p@6 e@7 e@8 i@10 i@12 j@13 j@14 epm@16 epm@18 ==emptyRule
2 d@22 d@25 ==2
test begin arithExprPE 1 input: 1 + 2 * 0 --------------------------------
parsed s@0 from 5 tokens, 47 steps, 36 states, Rules 26
s@0 s@1 s@0 s@2 p@3 p@6 e@7 e@8 i@10 i@12 j@13 j@14 epm@16 epm@18 ==emptyRule
1 d@22 d@24 ==1
+ pm@19 pm@20 ==+
p@3 p@4 p@3 p@6 e@7 e@8 i@10 i@12 j@13 j@14 epm@16 epm@18 ==emptyRule
2 d@22 d@25 ==2
* ==*
e@7 e@8 i@10 i@12 j@13 j@14 epm@16 epm@18 ==emptyRule
0 d@22 d@23 ==0
test begin arithExprPE 2 input: 2 * ( 1 * 2 + 0 ) --------------------------------
parsed s@0 from 9 tokens, 71 steps, 36 states, Rules 26
s@0 s@2 p@3 p@4 p@3 p@6 e@7 e@8 i@10 i@12 j@13 j@14 epm@16 epm@18 ==emptyRule
2 d@22 d@25 ==2
* ==*
( e@7 e@8 i@10 i@11 ==(
s@0 s@1 s@0 s@2 p@3 p@4 p@3 p@6 e@7 e@8 i@10 i@12 j@13 j@14 epm@16 epm@18 ==emptyRule
1 d@22 d@24 ==1
* ==*
e@7 e@8 i@10 i@12 j@13 j@14 epm@16 epm@18 ==emptyRule
2 d@22 d@25 ==2
+ pm@19 pm@20 ==+
p@3 p@6 e@7 e@8 i@10 i@12 j@13 j@14 epm@16 epm@18 ==emptyRule
0 d@22 d@23 ==0
) ==)
test begin arithExprPE 3 input: 1 + 2 ( --------------------------------
dbg: syntax after 2 tokenNr 2 expected: !, ), *, +, -, /, 0, 1, 2, not lah: ( !
syntax test arithExprPE 3 : syntax after 2 tokenNr 2 expected: !, ), *, +, -, /, 0, 1, 2, not lah: ( !
input 1 + 2 (
test begin arithExprPE 4 input: 1 + 2 + --------------------------------
dbg: syntax after + tokenNr 3 expected: (, +, -, 0, 1, 2, not lah: !
syntax test arithExprPE 4 : syntax after + tokenNr 3 expected: (, +, -, 0, 1, 2, not lah: !
input 1 + 2 +
test begin arithExprPE 5 input: 1 0 / - - 1 1 + + - 1 2 / ( 1 - - 2 / + 0 ) --------------------------------
parsed s@0 from 22 tokens, 148 steps, 36 states, Rules 26
s@0 s@1 s@0 s@2 p@3 p@5 p@3 p@6 e@7 e@8 i@10 i@12 j@13 j@15 j@13 j@14 epm@16 epm@18 ==emptyRule
1 d@22 d@24 ==1
0 d@22 d@23 ==0
/ ==/
- e@7 e@8 i@10 i@12 j@13 j@15 j@13 j@14 epm@16 epm@17 pm@19 pm@21 ==-
- epm@16 epm@17 pm@19 pm@21 ==-
epm@16 epm@18 ==emptyRule
1 d@22 d@24 ==1
1 d@22 d@24 ==1
+ pm@19 pm@20 ==+
+ p@3 p@5 p@3 p@6 e@7 e@8 i@10 i@12 j@13 j@15 j@13 j@14 epm@16 epm@17 pm@19 pm@20 ==+
- epm@16 epm@17 pm@19 pm@21 ==-
epm@16 epm@18 ==emptyRule
1 d@22 d@24 ==1
2 d@22 d@25 ==2
/ ==/
( e@7 e@8 i@10 i@11 ==(
s@0 s@1 s@0 s@2 p@3 p@6 e@7 e@8 i@10 i@12 j@13 j@14 epm@16 epm@18 ==emptyRule
1 d@22 d@24 ==1
- pm@19 pm@21 ==-
- p@3 p@5 p@3 p@6 e@7 e@8 i@10 i@12 j@13 j@14 epm@16 epm@17 pm@19 pm@21 ==-
epm@16 epm@18 ==emptyRule
2 d@22 d@25 ==2
/ ==/
+ e@7 e@8 i@10 i@12 j@13 j@14 epm@16 epm@17 pm@19 pm@20 ==+
epm@16 epm@18 ==emptyRule
0 d@22 d@23 ==0
) ==)
test begin arithExprPE 6 input: - - 2 * * + + 1 * * - 2 * 1 + 0 --------------------------------
parsed s@0 from 16 tokens, 98 steps, 36 states, Rules 26
- s@0 s@1 s@0 s@2 p@3 p@4 p@3 p@6 e@7 e@9 i@10 i@12 j@13 j@14 epm@16 epm@17 pm@19 pm@21 ==-
- epm@16 epm@17 pm@19 pm@21 ==-
epm@16 epm@18 ==emptyRule
2 d@22 d@25 ==2
* ==*
* ==*
+ e@7 e@9 i@10 i@12 j@13 j@14 epm@16 epm@17 pm@19 pm@20 ==+
+ epm@16 epm@17 pm@19 pm@20 ==+
epm@16 epm@18 ==emptyRule
1 d@22 d@24 ==1
* ==*
* ==*
- e@7 e@8 i@10 i@12 j@13 j@14 epm@16 epm@17 pm@19 pm@21 ==-
epm@16 epm@18 ==emptyRule
2 d@22 d@25 ==2
* ==*
e@7 e@8 i@10 i@12 j@13 j@14 epm@16 epm@18 ==emptyRule
1 d@22 d@24 ==1
+ pm@19 pm@20 ==+
p@3 p@6 e@7 e@8 i@10 i@12 j@13 j@14 epm@16 epm@18 ==emptyRule
0 d@22 d@23 ==0
arithExprPE-extA --- begin test extend--------------------------------
grammar source, ('p=a', "a='a' s 'b'")