Commit bd46ef92 authored by POTTIER Francois's avatar POTTIER Francois
Browse files

Log the construction mode.

parent 69ba861d
......@@ -52,7 +52,7 @@ SED=$(shell if [[ "$$OSTYPE" == "darwin"* ]] ; then echo gsed ; else echo sed ;
.PHONY: data
data: test
@ echo "Collecting data (using $(SED))..." && \
echo "name,terminals,nonterminals,lr0states,lr1states,lr1time" > analysis/data.csv && \
echo "name,mode,terminals,nonterminals,lr0states,lr1states,lr1time" > analysis/data.csv && \
directory=_build/default/test/static/src && \
successful=0 && timedout=0 && \
for timings in $$directory/*.out.timings ; do \
......@@ -63,12 +63,13 @@ data: test
((timedout++)) ; \
else \
((successful++)) ; \
mode=`$(SED) -n -e "s/^The construction mode is \([a-z\-]\+\)./\1/p" $$out` ; \
terminals=`$(SED) -n -e "s/^Grammar has \([0-9]\+\) terminal symbols./\1/p" $$out` ; \
nonterminals=`$(SED) -n -e "s/^Grammar has \([0-9]\+\) nonterminal symbols, among which [0-9]\+ start symbols./\1/p" $$out` ; \
lr0states=`$(SED) -n -e "s/^Built an LR(0) automaton with \([0-9]\+\) states./\1/p" $$out` ; \
lr1states=`$(SED) -n -e "s/^Built an LR(1) automaton with \([0-9]\+\) states./\1/p" $$out` ; \
lr1time=`$(SED) -n -e "s/^Construction of the LR(1) automaton: \(.*\)s/\1/p" $$timings` ; \
echo "$$name,$$terminals,$$nonterminals,$$lr0states,$$lr1states,$$lr1time" >> analysis/data.csv ; \
echo "$$name,$$mode,$$terminals,$$nonterminals,$$lr0states,$$lr1states,$$lr1time" >> analysis/data.csv ; \
fi \
done && \
echo "$$successful successful tests; $$timedout timed out tests."
......
......@@ -50,20 +50,32 @@ module type ALGORITHM = sig
module Run () : LR1_AUTOMATON
end
let algo : (module ALGORITHM) =
let algo, mode =
Settings.(match construction_mode with
| ModeCanonical ->
(module LR1Canonical : ALGORITHM)
| ModeInclusionOnly
(module LR1Canonical : ALGORITHM),
"canonical"
| ModeInclusionOnly ->
(module LR1Pager : ALGORITHM),
"no-pager"
| ModePager ->
(module LR1Pager : ALGORITHM)
(module LR1Pager : ALGORITHM),
"pager"
| ModeLALR ->
(module LALR : ALGORITHM)
(module LALR : ALGORITHM),
"lalr"
)
module Algorithm =
(val algo : ALGORITHM)
let () =
Error.logA 1 (fun f ->
Printf.fprintf f
"The construction mode is %s.\n"
mode
)
(* -------------------------------------------------------------------------- *)
(* Run the construction algorithm. *)
......
......@@ -541,6 +541,7 @@ follow(additive_init_expression) = Lxor Lsemicolon Lsc_or Lsc_and Lrunsignedshif
follow(additive_expression) = Lxor Lsemicolon Lsc_or Lsc_and Lrunsignedshift Lrsignedshift Lrparen Lrbracket Lrbrace Lplus Lneq Lne Lminus Llshift Lless Lle Lhook Lgreater Lge Leqq Leq Lcomma Lcolon Lbit_or Lbit_and KWinstanceof KWin
Built an LR(0) automaton with 660 states.
The grammar is not SLR(1) -- 12 states have a conflict.
The construction mode is pager.
Built an LR(1) automaton with 660 states.
Warning: one state has shift/reduce conflicts.
Warning: one shift/reduce conflict was arbitrarily resolved.
......
......@@ -237,6 +237,7 @@ follow(address) = error UPSERT_WITH_BEFORE UPSERT_WITH UPDATE_SUFFIX UPDATE UNKN
follow(access) = error UPSERT_WITH_BEFORE UPSERT_WITH UPDATE_SUFFIX UPDATE UNKNOWN UNIT TRIGGER TIMES THEN STRING SOURCE SORT SIZE SINK SEND SEMICOLON RPAREN ROLE RBRACKETLT RBRACKETHASH RBRACKETCOLON RBRACKET RBRACELT RBRACECOLON RBRACEBAR RBRACE PLUS PERIOD PEEK_WITH_VID PEEK OR OF NOTHING NOT NETWORK NEQ NEG MODULO MIN_WITH MAP LT LPAREN LET LEQ LBRACKETLT LBRACKETHASH LBRACKETGEQ LBRACKETCOLON LBRACKETBAR LBRACKET LBRACELT LBRACECOLON LBRACEBAR LBRACE LARROW JUST ITERATE IP INTEGER INSERT INDIRECT IN IGNORE IF IDENTIFIER GT GROUPBYAGGREGATE GETS GEQ FOREIGN FLOAT FLATTEN FILTERGEQ FILTER EXPECTED EQ ELSE DO DIVIDE DELETE_PREFIX DELETE DEFAULT DECLARE CONSUME CONCAT COMMA COLON CASE BOOL BINDFLOW BIND BAR BACKSLASH AT_WITH AS ANNOTATE AND AGGREGATEV AGGREGATE #
Built an LR(0) automaton with 762 states.
The grammar is not SLR(1) -- 70 states have a conflict.
The construction mode is pager.
Built an LR(1) automaton with 1441 states.
565 shift/reduce conflicts were silently solved.
File "K3Parser.mly", line 177, characters 0-5:
......
......@@ -179,6 +179,7 @@ follow(agent_expression) = error UNTIL TRUE SEMICOLON REPEAT PIPE NEWLINE KAPPA_
follow(a_link_state) = KAPPA_WLD KAPPA_LNK DIV COMMA CL_PAR
Built an LR(0) automaton with 357 states.
The grammar is not SLR(1) -- 20 states have a conflict.
The construction mode is pager.
Built an LR(1) automaton with 400 states.
90 shift/reduce conflicts were silently solved.
156 out of 400 states have a default reduction.
......
......@@ -235,6 +235,7 @@ follow(agent_modif) = error TRUE TOKEN SIGNATURE SEMICOLON RAR PLOT PIPE PERT OB
follow(agent) = error TRUE TOKEN SIGNATURE SEMICOLON RAR PLOT PIPE PERT OBS LRAR LET LABEL INIT ID FALSE EOF DOT CONFIG COMMA CL_PAR AT
Built an LR(0) automaton with 519 states.
The grammar is not SLR(1) -- 4 states have a conflict.
The construction mode is pager.
Built an LR(1) automaton with 580 states.
193 out of 580 states have a default reduction.
304 out of 580 states are represented.
......
......@@ -403,6 +403,7 @@ follow(arrow_type) = UIDENTIFIER TIMES SEMICOL RPAREN RBRACKET RBRACE PLUS NUMBE
follow(actual_generics) = UIDENTIFIER TIMES SEMICOL RPAREN RBRACKET RBRACE QMARK PLUS NUMBER NOTIN NEWLINE NEQ MINUS LT LPAREN LIDENTIFIER LE LBRACKET KWtrue KWthen KWrequire KWrename KWproof KWor KWnote KWlocal KWin KWimmutable KWghost KWfalse KWensure KWend KWelseif KWelse KWdo KWdeferred KWclass KWcase KWas KWand KWall GT GE EQ DOT DIVIDE DCOLON DBAR DARROW COMMA COLON CARET BAR ASSIGN ARROW #
Built an LR(0) automaton with 428 states.
The grammar is not SLR(1) -- 52 states have a conflict.
The construction mode is pager.
Built an LR(1) automaton with 428 states.
788 shift/reduce conflicts were silently solved.
File "albatross.mly", line 166, characters 9-18:
......
......@@ -11,6 +11,7 @@ follow(expr) = PLUS EOF
follow(declarations) = #
Built an LR(0) automaton with 11 states.
The grammar is not SLR(1) -- 1 states have a conflict.
The construction mode is pager.
Built an LR(1) automaton with 11 states.
One shift/reduce conflict was silently solved.
6 out of 11 states have a default reduction.
......
......@@ -55,6 +55,7 @@ follow(binding) = IN AND
follow(atomic_expression) = VAL RPAREN RCURLY PLUS IN EOF END DOT AND
Built an LR(0) automaton with 68 states.
The grammar is SLR(1).
The construction mode is pager.
Built an LR(1) automaton with 68 states.
27 out of 68 states have a default reduction.
15 out of 68 states are represented.
......
......@@ -79,6 +79,7 @@ follow(AType) = SEMI RSQUARE RPAREN RCURLY EQ DOT COMMA ARROW
follow(ATerm) = SEMI RPAREN RCURLY LSQUARE LPAREN LCURLY LCID IN DOT COMMA
Built an LR(0) automaton with 97 states.
The grammar is SLR(1).
The construction mode is pager.
Built an LR(1) automaton with 97 states.
34 out of 97 states have a default reduction.
32 out of 97 states are represented.
......
......@@ -111,6 +111,7 @@ follow(declaration) = TYPE SORT IDENTIFIER EOF CONTAINER
follow(container) = error TYPE STAR SORT SEMICOLON RBRACE RANGLE IDENTIFIER EOF CONTAINER BAR
Built an LR(0) automaton with 139 states.
The grammar is SLR(1).
The construction mode is pager.
Built an LR(1) automaton with 143 states.
74 out of 143 states have a default reduction.
35 out of 143 states are represented.
......
......@@ -139,6 +139,7 @@ follow(app_or_qid) = SLASH SEMI DOT DCG_ARROW COMMA
follow(app) = UNDERSCORE TRUE SLASH SEMI RPAREN RBRACK RBRACE QUAL_ID LPAREN LITERAL LBRACK LARROW IS INT INFIXR9 INFIXR8 INFIXR7 INFIXR6 INFIXR5 INFIXR4 INFIXR3 INFIXR2 INFIXR1 INFIXN9 INFIXN8 INFIXN7 INFIXN6 INFIXN5 INFIXN4 INFIXN3 INFIXN2 INFIXN1 INFIXL9 INFIXL8 INFIXL7 INFIXL6 INFIXL5 INFIXL4 INFIXL3 INFIXL2 INFIXL1 ID HASH EQ DOT DCG_ARROW DARROW CUT CONS COMMA CHAR BAR ARROW
Built an LR(0) automaton with 259 states.
The grammar is not SLR(1) -- 54 states have a conflict.
The construction mode is pager.
Built an LR(1) automaton with 259 states.
1418 shift/reduce conflicts were silently solved.
79 out of 259 states have a default reduction.
......
......@@ -59,6 +59,7 @@ follow(decll) = Llambda Lident
follow(atom) = Lstring Lsemi Lrpar Lperiod Llpar Llambda Lint Lident Lend
Built an LR(0) automaton with 71 states.
The grammar is SLR(1).
The construction mode is pager.
Built an LR(1) automaton with 71 states.
29 out of 71 states have a default reduction.
24 out of 71 states are represented.
......
......@@ -543,6 +543,7 @@ follow(anon_name(tt_name)) = UNDERSCORE RBRACE NAME LPAREN COLON
follow(abstraction) = REF RAISE QUOTED_STRING QQMARK PREFIXOP OCCURS NATURAL NAME LPAREN LBRACK CONVERT CONTEXT CONGRUENCE BANG ABSTRACT
Built an LR(0) automaton with 701 states.
The grammar is not SLR(1) -- 47 states have a conflict.
The construction mode is pager.
Built an LR(1) automaton with 702 states.
136 shift/reduce conflicts were silently solved.
261 out of 702 states have a default reduction.
......
......@@ -15,6 +15,7 @@ follow(foo) = EOF C A
follow(bar) = EOF C A
Built an LR(0) automaton with 16 states.
The grammar is SLR(1).
The construction mode is pager.
Built an LR(1) automaton with 16 states.
7 out of 16 states have a default reduction.
3 out of 16 states are represented.
......
......@@ -23,6 +23,7 @@ follow(midrule(__anonymous_1)) = A
follow(list(__anonymous_0(A,B))) = EOF D
Built an LR(0) automaton with 20 states.
The grammar is SLR(1).
The construction mode is pager.
Built an LR(1) automaton with 20 states.
9 out of 20 states have a default reduction.
6 out of 20 states are represented.
......
......@@ -23,6 +23,7 @@ follow(list(__anonymous_0(C,D))) = EOF
follow(list(__anonymous_0(A,B))) = EOF D C
Built an LR(0) automaton with 15 states.
The grammar is SLR(1).
The construction mode is pager.
Built an LR(1) automaton with 15 states.
8 out of 15 states have a default reduction.
6 out of 15 states are represented.
......
......@@ -15,6 +15,7 @@ follow(list(__anonymous_1)) = EOF
follow(list(__anonymous_0)) = EOF D
Built an LR(0) automaton with 14 states.
The grammar is SLR(1).
The construction mode is pager.
Built an LR(1) automaton with 14 states.
6 out of 14 states have a default reduction.
6 out of 14 states are represented.
......
......@@ -75,6 +75,7 @@ follow(coeff0) = TK_VAR TK_SUPEG TK_SUP TK_SUB TK_RPAR TK_POW TK_MUL TK_MODULO T
follow(coeff) = TK_VAR TK_SUPEG TK_SUP TK_SUB TK_MUL TK_MOD TK_INFEG TK_INF TK_EOF TK_EG TK_DISEG TK_ADD
Built an LR(0) automaton with 121 states.
The grammar is SLR(1).
The construction mode is pager.
Built an LR(1) automaton with 121 states.
49 out of 121 states have a default reduction.
41 out of 121 states are represented.
......
......@@ -87,6 +87,7 @@ follow(afield_list) = error GT
follow(afield) = error LIDENT GT
Built an LR(0) automaton with 108 states.
The grammar is not SLR(1) -- 2 states have a conflict.
The construction mode is pager.
Built an LR(1) automaton with 146 states.
60 out of 146 states have a default reduction.
50 out of 146 states are represented.
......
......@@ -115,6 +115,7 @@ follow(ATerm) = SEMI RPAREN LPAREN LCID DOT COMMA COLON ARROW
follow(AKind) = SEMI RPAREN
Built an LR(0) automaton with 111 states.
The grammar is not SLR(1) -- 1 states have a conflict.
The construction mode is pager.
Built an LR(1) automaton with 111 states.
File "attapl-deptypes.mly", line 84, characters 0-6:
Warning: the precedence level assigned to COMMA is never useful.
......
......@@ -145,6 +145,7 @@ follow(bindings) = RBRACE LET EOF
follow(binding) = RBRACE LET IN EOF
Built an LR(0) automaton with 128 states.
The grammar is not SLR(1) -- 6 states have a conflict.
The construction mode is pager.
Built an LR(1) automaton with 128 states.
36 shift/reduce conflicts were silently solved.
51 out of 128 states have a default reduction.
......
......@@ -19,6 +19,7 @@ follow(liste(B)) = C #
follow(liste(A)) = C B #
Built an LR(0) automaton with 11 states.
The grammar is SLR(1).
The construction mode is pager.
Built an LR(1) automaton with 11 states.
Warning: 8 states have an end-of-stream conflict.
File "attributes-expansion.mly", line 13, characters 1-1:
......
......@@ -7,6 +7,7 @@ minimal(main) = (* 3 *) A B C
follow(main) = #
Built an LR(0) automaton with 5 states.
The grammar is SLR(1).
The construction mode is pager.
Built an LR(1) automaton with 5 states.
2 out of 5 states have a default reduction.
0 out of 5 states are represented.
......
......@@ -99,6 +99,7 @@ follow(block) = VOID VALUE UINT8 UINT256 TRUE THIS THEN SENDER SEMICOLON SELFDES
follow(arg) = RPAR COMMA
Built an LR(0) automaton with 192 states.
The grammar is not SLR(1) -- 12 states have a conflict.
The construction mode is pager.
Built an LR(1) automaton with 192 states.
65 shift/reduce conflicts were silently solved.
Warning: 11 states have shift/reduce conflicts.
......
......@@ -19,6 +19,7 @@ follow(atomic_expr) = TIMES RPAREN PLUS MINUS EOL DIV
follow(additive_expr) = RPAREN PLUS MINUS EOL
Built an LR(0) automaton with 20 states.
The grammar is SLR(1).
The construction mode is pager.
Built an LR(1) automaton with 20 states.
8 out of 20 states have a default reduction.
7 out of 20 states are represented.
......
......@@ -55,6 +55,7 @@ follow(expression) = SNE SEQ SEMICOLON RIGHT_PAREN RIGHT_BRACK PLUS MULTIPLY MOD
follow(binary_expression) = SNE SEQ SEMICOLON RIGHT_PAREN RIGHT_BRACK PLUS MULTIPLY MODULO MINUS LT LE GT GE DIVIDE CONCAT COMMA ANE AEQ
Built an LR(0) automaton with 106 states.
The grammar is not SLR(1) -- 16 states have a conflict.
The construction mode is pager.
Built an LR(1) automaton with 106 states.
211 shift/reduce conflicts were silently solved.
34 out of 106 states have a default reduction.
......
......@@ -39,6 +39,7 @@ follow(clauses) = #
follow(clause) = EOF DOT
Built an LR(0) automaton with 22 states.
The grammar is SLR(1).
The construction mode is pager.
Built an LR(1) automaton with 22 states.
11 out of 22 states have a default reduction.
5 out of 22 states are represented.
......
......@@ -15,6 +15,7 @@ follow(expr) = SIZE EOF BANG
follow(desc) = #
Built an LR(0) automaton with 14 states.
The grammar is not SLR(1) -- 4 states have a conflict.
The construction mode is pager.
Built an LR(1) automaton with 14 states.
3 shift/reduce conflicts were silently solved.
Warning: 3 states have shift/reduce conflicts.
......
......@@ -41,6 +41,7 @@ follow(comma_field_list) = Trbrace
follow(atom) = Tsharp Trbrace Tcomma
Built an LR(0) automaton with 34 states.
The grammar is SLR(1).
The construction mode is pager.
Built an LR(1) automaton with 47 states.
21 out of 47 states have a default reduction.
11 out of 47 states are represented.
......
......@@ -41,6 +41,7 @@ follow(comma_field_list) = Trbrace
follow(atom) = Tsharp Trbrace Tcomma
Built an LR(0) automaton with 34 states.
The grammar is SLR(1).
The construction mode is pager.
Built an LR(1) automaton with 47 states.
21 out of 47 states have a default reduction.
11 out of 47 states are represented.
......
......@@ -27,6 +27,7 @@ follow(name) = COMMA COLON
follow(def) = #
Built an LR(0) automaton with 19 states.
The grammar is not SLR(1) -- 1 states have a conflict.
The construction mode is pager.
Built an LR(1) automaton with 20 states.
9 out of 20 states have a default reduction.
5 out of 20 states are represented.
......
......@@ -31,6 +31,7 @@ follow(empty) = LPAR
follow(cr) = RPAR LPAR
Built an LR(0) automaton with 19 states.
The grammar is SLR(1).
The construction mode is pager.
Built an LR(1) automaton with 19 states.
9 out of 19 states have a default reduction.
5 out of 19 states are represented.
......
......@@ -35,6 +35,7 @@ follow(empty) = LPAR
follow(cr) = RPAR LPAR
Built an LR(0) automaton with 20 states.
The grammar is SLR(1).
The construction mode is pager.
Built an LR(1) automaton with 20 states.
10 out of 20 states have a default reduction.
5 out of 20 states are represented.
......
......@@ -316,6 +316,7 @@ follow(aexp) = WITH VTYPE USING UIDENT TYPE TILDE TEST STYPE STR STAR SEMI RPARE
follow(aapat) = RPAREN EQUAL COMMA COLONCOLON COLON ARROW
Built an LR(0) automaton with 508 states.
The grammar is not SLR(1) -- 11 states have a conflict.
The construction mode is pager.
Built an LR(1) automaton with 511 states.
195 out of 511 states have a default reduction.
208 out of 511 states are represented.
......
......@@ -15,6 +15,7 @@ follow(expr) = SEP LIDENT EOF DOT
follow(debut) = #
Built an LR(0) automaton with 14 states.
The grammar is not SLR(1) -- 5 states have a conflict.
The construction mode is pager.
Built an LR(1) automaton with 16 states.
Warning: 4 states have shift/reduce conflicts.
Warning: 2 states have reduce/reduce conflicts.
......
......@@ -15,6 +15,7 @@ follow(expr) = SEP LIDENT DOT
follow(debut) = #
Built an LR(0) automaton with 14 states.
The grammar is not SLR(1) -- 6 states have a conflict.
The construction mode is pager.
Built an LR(1) automaton with 16 states.
Warning: 4 states have shift/reduce conflicts.
Warning: 3 states have reduce/reduce conflicts.
......
......@@ -315,6 +315,7 @@ follow(array_expr) = error WITH UIDENT UARROW TYPE TOPVAR TOPDEF TO THEN STRING
follow(actual_args) = error WITH UIDENT UARROW TYPE TOPVAR TOPDEF TO THEN STRING SLASH_DOT SLASH SEMI RPAREN RBRACK RBRACE PLUS_DOT PLUS PIPE NL MOD MINUS_DOT MINUS LPAREN LOR LESS_LESS LESS_GREATER LESS_EQUAL LESS LBRACK LAND INT IN IDENT GREATER_EQUAL GREATER FLOAT EXTERNAL EXCL EXCEPTION EQUAL EOF END ELSE DOL DO CONS COMMA CHAR BOOL ATOM AST_DOT AST AND
Built an LR(0) automaton with 457 states.
The grammar is not SLR(1) -- 84 states have a conflict.
The construction mode is pager.
Built an LR(1) automaton with 697 states.
2098 shift/reduce conflicts were silently solved.
203 out of 697 states have a default reduction.
......
......@@ -255,6 +255,7 @@ follow(additive_expression) = SEMICOLON RPAREN RIGHT_OP RBRACK RBRACE QUESTION P
follow(abstract_declarator) = RPAREN COMMA
Built an LR(0) automaton with 349 states.
The grammar is not SLR(1) -- 3 states have a conflict.
The construction mode is pager.
Built an LR(1) automaton with 349 states.
Warning: one state has shift/reduce conflicts.
Warning: one shift/reduce conflict was arbitrarily resolved.
......
......@@ -275,6 +275,7 @@ follow(additive_expression) = SEMICOLON RPAREN RIGHT_OP RBRACK RBRACE QUESTION P
follow(abstract_declarator) = RPAREN COMMA
Built an LR(0) automaton with 401 states.
The grammar is not SLR(1) -- 3 states have a conflict.
The construction mode is pager.
Built an LR(1) automaton with 401 states.
178 out of 401 states have a default reduction.
120 out of 401 states are represented.
......
......@@ -11,6 +11,7 @@ follow(main) = #
follow(expr) = TIMES RPAREN PLUS MINUS EOL DIV
Built an LR(0) automaton with 18 states.
The grammar is not SLR(1) -- 5 states have a conflict.
The construction mode is pager.
Built an LR(1) automaton with 18 states.
20 shift/reduce conflicts were silently solved.
7 out of 18 states have a default reduction.
......
......@@ -19,6 +19,7 @@ follow(atomic_expr) = TIMES RPAREN PLUS MINUS EOL DIV
follow(additive_expr) = RPAREN PLUS MINUS EOL
Built an LR(0) automaton with 20 states.
The grammar is SLR(1).
The construction mode is pager.
Built an LR(1) automaton with 20 states.
8 out of 20 states have a default reduction.
7 out of 20 states are represented.
......
......@@ -11,6 +11,7 @@ follow(main) = #
follow(expr) = TIMES RPAREN PLUS MINUS EOL DIV
Built an LR(0) automaton with 18 states.
The grammar is not SLR(1) -- 5 states have a conflict.
The construction mode is pager.
Built an LR(1) automaton with 18 states.
20 shift/reduce conflicts were silently solved.
7 out of 18 states have a default reduction.
......
......@@ -11,6 +11,7 @@ follow(main) = #
follow(expr) = TIMES RPAREN PLUS MINUS EOL DIV
Built an LR(0) automaton with 18 states.
The grammar is not SLR(1) -- 5 states have a conflict.
The construction mode is pager.
Built an LR(1) automaton with 18 states.
20 shift/reduce conflicts were silently solved.
7 out of 18 states have a default reduction.
......
......@@ -19,6 +19,7 @@ follow(fold_left(additive_op,multiplicative_expr)) = RPAREN PLUS MINUS EOL
follow(atomic_expr) = TIMES RPAREN PLUS MINUS EOL DIV
Built an LR(0) automaton with 20 states.
The grammar is SLR(1).
The construction mode is pager.
Built an LR(1) automaton with 20 states.
8 out of 20 states have a default reduction.
7 out of 20 states are represented.
......
......@@ -11,6 +11,7 @@ follow(main) = #
follow(expr) = TIMES RPAREN PLUS MINUS EOL DIV
Built an LR(0) automaton with 18 states.
The grammar is not SLR(1) -- 5 states have a conflict.
The construction mode is pager.
Built an LR(1) automaton with 18 states.
20 shift/reduce conflicts were silently solved.
7 out of 18 states have a default reduction.
......
......@@ -59,6 +59,7 @@ follow(dot_lookup) = VAR TIMES TEXT SET RPAREN RBRACKET PLUS OR OPEN NOT_EQUALS
follow(bracket_lookup) = VAR TIMES TEXT SET RPAREN RBRACKET PLUS OR OPEN NOT_EQUALS MOD MINUS MACRO LESS_OR_EQUAL LESS LBRACKET INCLUDE IF IDENT GREATER_OR_EQUAL GREATER FOREACH EXPANSION EQUALS_EQUALS EOF END ELSEIF ELSE DIV COMMA AND
Built an LR(0) automaton with 153 states.
The grammar is not SLR(1) -- 16 states have a conflict.
The construction mode is pager.
Built an LR(1) automaton with 153 states.
195 shift/reduce conflicts were silently solved.
File "camltemplate.1.0.2-ctParser.mly", line 108, characters 0-5:
......
......@@ -35,6 +35,7 @@ follow(header) = RESET EOF
follow(elem) = TERTIARY SECONDARY RESET PRIMARY EXPAND EQ EOF
Built an LR(0) automaton with 37 states.
The grammar is not SLR(1) -- 1 states have a conflict.
The construction mode is pager.
Built an LR(1) automaton with 37 states.
One shift/reduce conflict was silently solved.
File "camomile.1.0.1-colParser.mly", line 53, characters 2-7:
......
......@@ -219,6 +219,7 @@ follow(attr_operand) = CLOSE_SQUARE
follow(atrule) = VAR SEL_FUNC PERIOD PAGE OPEN_SQUARE MEDIA KEYFRAMES IMPORT IDENT HASH FONTFACE EOF DOUBLE_COLON COLON CHARSET ASTERISK
Built an LR(0) automaton with 186 states.
The grammar is not SLR(1) -- 5 states have a conflict.
The construction mode is pager.
Built an LR(1) automaton with 186 states.
16 shift/reduce conflicts were silently solved.
95 out of 186 states have a default reduction.
......
......@@ -35,6 +35,7 @@ follow(hosts) = RBRACKET
follow(host) = RBRACKET HOST
Built an LR(0) automaton with 56 states.
The grammar is SLR(1).
The construction mode is pager.
Built an LR(1) automaton with 56 states.
16 out of 56 states have a default reduction.
13 out of 56 states are represented.
......
......@@ -1143,6 +1143,7 @@ follow(actualParameterList) = Upper UNIQUE UNION SemiColon RightParen RightDoubl
follow(actualParameter) = RightBrace Comma
Built an LR(0) automaton with 854 states.
The grammar is not SLR(1) -- 83 states have a conflict.
The construction mode is pager.
Built an LR(1) automaton with 857 states.
Warning: 45 states have shift/reduce conflicts.
Warning: 47 states have reduce/reduce conflicts.
......
......@@ -227,6 +227,7 @@ follow(declaration) = Typedef_ident KW_volatile KW_void KW_unsigned KW_union KW_
follow(abstract_declarator) = KW_cparen KW_comma
Built an LR(0) automaton with 134 states.
The grammar is SLR(1).
The construction mode is pager.
Built an LR(1) automaton with 134 states.
68 out of 134 states have a default reduction.
30 out of 134 states are represented.
......
......@@ -477,6 +477,7 @@ follow(abs_direct_decl_opt) = LBRACKET
follow(abs_direct_decl) = VOLATILE THREAD RPAREN RESTRICT MSATTR LPAREN LBRACKET DECLSPEC CONST COMMA ATTRIBUTE
Built an LR(0) automaton with 747 states.
The grammar is not SLR(1) -- 28 states have a conflict.
The construction mode is pager.
Built an LR(1) automaton with 1032 states.
25 shift/reduce conflicts were silently solved.
Only 1027 states remain after resolving shift/reduce conflicts.
......
......@@ -199,6 +199,7 @@ follow(arglo) = TILDE STAR SIZEOF PLUS MINUS LPAREN IDENT EXCLAM CST_INT ARG_v A
follow(argb) = TILDE STAR SIZEOF PLUS MINUS LPAREN IDENT EXCLAM CST_INT ARG_v ARG_u ARG_l ARG_g ARG_e ARG_d AND ALIGNOF
Built an LR(0) automaton with 284 states.
The grammar is not SLR(1) -- 37 states have a conflict.
The construction mode is pager.
Built an LR(1) automaton with 302 states.
536 shift/reduce conflicts were silently solved.
File "cil-formatparse.mly", line 295, characters 0-5:
......
......@@ -63,6 +63,7 @@ follow(ident_seq) = NEWLINE COLON
follow(comment) = SORT LEFT_PAR IDENT #
Built an LR(0) automaton with 72 states.
The grammar is SLR(1).
The construction mode is pager.
Built an LR(1) automaton with 77 states.
31 out of 77 states have a default reduction.
28 out of 77 states are represented.
......
......@@ -31,6 +31,7 @@ follow(gen_poly_entry) = #
follow(gen_poly) = PLUS PARDROITE MULT MINUS EXP EOF
Built an LR(0) automaton with 50 states.
The grammar is not SLR(1) -- 8 states have a conflict.
The construction mode is pager.
Built an LR(1) automaton with 50 states.
32 shift/reduce conflicts were silently solved.
16 out of 50 states have a default reduction.
......
......@@ -67,6 +67,7 @@ follow(cword) = EOF
follow(constr) = SEMICOLON EOF
Built an LR(0) automaton with 62 states.
The grammar is not SLR(1) -- 2 states have a conflict.
The construction mode is pager.
Built an LR(1) automaton with 62 states.
25 out of 62 states have a default reduction.
24 out of 62 states are represented.
......
......@@ -35,6 +35,7 @@ follow(poly) = SEMICOLON RIGHT_PAR PLUS MULT MINUS EXP
follow(interp) = EOF
Built an LR(0) automaton with 40 states.
The grammar is not SLR(1) -- 4 states have a conflict.
The construction mode is pager.
Built an LR(1) automaton with 40 states.
16 shift/reduce conflicts were silently solved.
13 out of 40 states have a default reduction.
......
......@@ -21,6 +21,7 @@ follow(expr) = VERTICALBAR PLUS PARDROITE OR MULT MINUS IMPLIES EXP EQUIV EOF DI
follow(constraint_entry) = #
Built an LR(0) automaton with 58 states.
The grammar is not SLR(1) -- 12 states have a conflict.
The construction mode is pager.
Built an LR(1) automaton with 58 states.
45 shift/reduce conflicts were silently solved.
File "cime-poly.mly", line 32, characters 0-9:
......
......@@ -27,6 +27,7 @@ follow(decl) = SEMICOLON
follow(arity) = SEMICOLON
Built an LR(0) automaton with 24 states.
The grammar is SLR(1).
The construction mode is pager.
Built an LR(1) automaton with 24 states.
16 out of 24 states have a default reduction.
3 out of 24 states are represented.
......
......@@ -245,6 +245,7 @@ follow(arityaux) = UNIFICATION TOKEN_INCLUDE THEORIE SUBSORTES SORTES PROBLEMES
follow(arity) = UNIFICATION TOKEN_INCLUDE THEORIE SUBSORTES SORTES PROBLEMES POINT_VIRGULE ORDRE OPERATEURS KW_END INDUCTIVE IDENT EQUATIONS EOF CONJECTURES AS
Built an LR(0) automaton with 253 states.
The grammar is not SLR(1) -- 6 states have a conflict.
The construction mode is pager.
Built an LR(1) automaton with 253 states.
18 shift/reduce conflicts were silently solved.
103 out of 253 states have a default reduction.
......
......@@ -27,6 +27,7 @@ follow(rule_set) = EOF
follow(rule) = SEMICOLON EOF
Built an LR(0) automaton with 30 states.
The grammar is not SLR(1) -- 2 states have a conflict.
The construction mode is pager.
Built an LR(1) automaton with 30 states.
2 shift/reduce conflicts were silently solved.
10 out of 30 states have a default reduction.
...