handcrafted.messages 706 KB
Newer Older
1 2 3 4 5 6 7 8 9
# GUIDELINES:
# Be extremely careful when editing this file: it is automatically generated.
# Any modifications done to it can be erased by running the Makefile.
# Do not remove the spurious spaces at the end of lines to avoid git differences.
# One can use $0 anywhere to refer to the last token read.


term_eof: EPSILON WRITES 
##
10
## Ends in an error in state: 316.
11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32
##
## single_term_ -> single_term . AT uident [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## single_term_ -> single_term . ARROW single_term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## single_term_ -> single_term . LRARROW single_term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## single_term_ -> single_term . OR single_term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## single_term_ -> single_term . BARBAR single_term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## single_term_ -> single_term . AND single_term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## single_term_ -> single_term . AMPAMP single_term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## single_term_ -> single_term . BY single_term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## single_term_ -> single_term . SO single_term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## single_term_ -> single_term . OP1 single_term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## single_term_ -> single_term . EQUAL single_term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## single_term_ -> single_term . LTGT single_term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## single_term_ -> single_term . LT single_term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## single_term_ -> single_term . GT single_term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## single_term_ -> single_term . OP2 single_term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## single_term_ -> single_term . OP3 single_term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## single_term_ -> single_term . OP4 single_term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## single_term_ -> single_term . MINUS single_term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## single_term_ -> single_term . cast [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## term -> single_term . [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## term -> single_term . COMMA term_ [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
33 34 35 36 37 38 39 40 41
##
## The known suffix of the stack is as follows:
## single_term 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_eof: UIDENT COMMA EPSILON WRITES 
##
42
## Ends in an error in state: 393.
43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64
##
## single_term_ -> single_term . AT uident [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## single_term_ -> single_term . ARROW single_term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## single_term_ -> single_term . LRARROW single_term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## single_term_ -> single_term . OR single_term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## single_term_ -> single_term . BARBAR single_term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## single_term_ -> single_term . AND single_term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## single_term_ -> single_term . AMPAMP single_term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## single_term_ -> single_term . BY single_term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## single_term_ -> single_term . SO single_term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## single_term_ -> single_term . OP1 single_term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## single_term_ -> single_term . EQUAL single_term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## single_term_ -> single_term . LTGT single_term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## single_term_ -> single_term . LT single_term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## single_term_ -> single_term . GT single_term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## single_term_ -> single_term . OP2 single_term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## single_term_ -> single_term . OP3 single_term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## single_term_ -> single_term . OP4 single_term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## single_term_ -> single_term . MINUS single_term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## single_term_ -> single_term . cast [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## term_ -> single_term . [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## term_ -> single_term . COMMA term_ [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
65 66 67 68 69 70 71 72 73
##
## The known suffix of the stack is as follows:
## single_term 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_eof: UIDENT COMMA UIDENT COMMA WRITES 
##
74
## Ends in an error in state: 394.
75
##
76
## term_ -> single_term COMMA . term_ [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
77 78 79 80 81 82 83 84 85
##
## The known suffix of the stack is as follows:
## single_term COMMA 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_eof: UIDENT COMMA WRITES 
##
86
## Ends in an error in state: 391.
87
##
88
## term -> single_term COMMA . term_ [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
89 90 91 92 93 94 95 96 97
##
## The known suffix of the stack is as follows:
## single_term COMMA 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_eof: UIDENT WITH 
##
98
## Ends in an error in state: 1189.
99 100 101 102 103 104 105 106 107 108
##
## term_eof -> term . EOF [ # ]
##
## The known suffix of the stack is as follows:
## term 
##
## WARNING: This example involves spurious reductions.
## This implies that, although the LR(1) items shown above provide an
## accurate view of the past (what has been recognized so far), they
## may provide an INCOMPLETE view of the future (what was expected next).
109 110 111 112 113 114 115
## In state 291, spurious reduction of production ident_rich -> uident 
## In state 349, spurious reduction of production qualid -> ident_rich 
## In state 339, spurious reduction of production term_arg_ -> qualid 
## In state 309, spurious reduction of production single_term_ -> term_arg_ 
## In state 315, spurious reduction of production mk_term(single_term_) -> single_term_ 
## In state 346, spurious reduction of production single_term -> mk_term(single_term_) 
## In state 316, spurious reduction of production term -> single_term 
116 117 118 119 120 121
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_eof: WRITES 
##
122
## Ends in an error in state: 1187.
123 124 125 126 127 128 129 130 131 132 133
##
## term_eof' -> . term_eof [ # ]
##
## The known suffix of the stack is as follows:
## 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: BEGIN UIDENT WITH 
##
134
## Ends in an error in state: 457.
135
##
136
## term_block -> BEGIN term . END [ WITH VAL USE UIDENT TYPE TRUE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC REAL RANGE PREDICATE OR OPPREF OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LIDENT LET LEMMA LEFTSQ LEFTPAR LEFTBRC LARROW INTEGER INDUCTIVE IN IMPORT GT GOAL FUNCTION FLOAT FALSE EXCEPTION EQUAL EOF END ELSE DOTDOT DOT CORE_UIDENT CORE_LIDENT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BEGIN BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
137 138 139 140 141 142 143 144
##
## The known suffix of the stack is as follows:
## BEGIN term 
##
## WARNING: This example involves spurious reductions.
## This implies that, although the LR(1) items shown above provide an
## accurate view of the past (what has been recognized so far), they
## may provide an INCOMPLETE view of the future (what was expected next).
145 146 147 148 149 150 151
## In state 291, spurious reduction of production ident_rich -> uident 
## In state 349, spurious reduction of production qualid -> ident_rich 
## In state 339, spurious reduction of production term_arg_ -> qualid 
## In state 309, spurious reduction of production single_term_ -> term_arg_ 
## In state 315, spurious reduction of production mk_term(single_term_) -> single_term_ 
## In state 346, spurious reduction of production single_term -> mk_term(single_term_) 
## In state 316, spurious reduction of production term -> single_term 
152 153 154 155 156 157
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: BEGIN WRITES 
##
158
## Ends in an error in state: 200.
159
##
160 161
## term_block -> BEGIN . term END [ WITH VAL USE UIDENT TYPE TRUE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC REAL RANGE PREDICATE OR OPPREF OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LIDENT LET LEMMA LEFTSQ LEFTPAR LEFTBRC LARROW INTEGER INDUCTIVE IN IMPORT GT GOAL FUNCTION FLOAT FALSE EXCEPTION EQUAL EOF END ELSE DOTDOT DOT CORE_UIDENT CORE_LIDENT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BEGIN BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## term_block -> BEGIN . END [ WITH VAL USE UIDENT TYPE TRUE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC REAL RANGE PREDICATE OR OPPREF OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LIDENT LET LEMMA LEFTSQ LEFTPAR LEFTBRC LARROW INTEGER INDUCTIVE IN IMPORT GT GOAL FUNCTION FLOAT FALSE EXCEPTION EQUAL EOF END ELSE DOTDOT DOT CORE_UIDENT CORE_LIDENT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BEGIN BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
162 163 164 165 166 167 168 169 170
##
## The known suffix of the stack is as follows:
## BEGIN 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: FORALL UNDERSCORE COLON CORE_LIDENT WRITES 
##
171
## Ends in an error in state: 326.
172 173 174 175 176 177 178 179 180 181 182
##
## separated_nonempty_list(COMMA,quant_vars) -> quant_vars . [ LEFTSQ DOT ]
## separated_nonempty_list(COMMA,quant_vars) -> quant_vars . COMMA separated_nonempty_list(COMMA,quant_vars) [ LEFTSQ DOT ]
##
## The known suffix of the stack is as follows:
## quant_vars 
##
## WARNING: This example involves spurious reductions.
## This implies that, although the LR(1) items shown above provide an
## accurate view of the past (what has been recognized so far), they
## may provide an INCOMPLETE view of the future (what was expected next).
183 184 185 186 187
## In state 89, spurious reduction of production ty_arg -> lqualid 
## In state 83, spurious reduction of production ty -> ty_arg 
## In state 125, spurious reduction of production cast -> COLON ty 
## In state 331, spurious reduction of production option(cast) -> cast 
## In state 330, spurious reduction of production quant_vars -> nonempty_list(binder_var) option(cast) 
188 189 190 191 192 193
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: FORALL UNDERSCORE COMMA WRITES 
##
194
## Ends in an error in state: 327.
195 196 197 198 199 200 201 202 203 204 205
##
## separated_nonempty_list(COMMA,quant_vars) -> quant_vars COMMA . separated_nonempty_list(COMMA,quant_vars) [ LEFTSQ DOT ]
##
## The known suffix of the stack is as follows:
## quant_vars COMMA 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: FORALL UNDERSCORE DOT WRITES 
##
206
## Ends in an error in state: 389.
207
##
208
## single_term_ -> quant comma_list1(quant_vars) triggers DOT . term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
209 210 211 212 213 214 215 216 217
##
## The known suffix of the stack is as follows:
## quant comma_list1(quant_vars) triggers DOT 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: FORALL UNDERSCORE LEFTSQ UIDENT BAR WRITES 
##
218
## Ends in an error in state: 386.
219 220 221 222 223 224 225 226 227 228 229
##
## separated_nonempty_list(BAR,comma_list1(single_term)) -> comma_list1(single_term) BAR . separated_nonempty_list(BAR,comma_list1(single_term)) [ RIGHTSQ ]
##
## The known suffix of the stack is as follows:
## comma_list1(single_term) BAR 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: FORALL UNDERSCORE LEFTSQ UIDENT RIGHTBRC 
##
230
## Ends in an error in state: 385.
231 232 233 234 235 236 237 238 239 240 241
##
## separated_nonempty_list(BAR,comma_list1(single_term)) -> comma_list1(single_term) . [ RIGHTSQ ]
## separated_nonempty_list(BAR,comma_list1(single_term)) -> comma_list1(single_term) . BAR separated_nonempty_list(BAR,comma_list1(single_term)) [ RIGHTSQ ]
##
## The known suffix of the stack is as follows:
## comma_list1(single_term) 
##
## WARNING: This example involves spurious reductions.
## This implies that, although the LR(1) items shown above provide an
## accurate view of the past (what has been recognized so far), they
## may provide an INCOMPLETE view of the future (what was expected next).
242 243 244 245 246 247 248 249
## In state 291, spurious reduction of production ident_rich -> uident 
## In state 349, spurious reduction of production qualid -> ident_rich 
## In state 339, spurious reduction of production term_arg_ -> qualid 
## In state 309, spurious reduction of production single_term_ -> term_arg_ 
## In state 315, spurious reduction of production mk_term(single_term_) -> single_term_ 
## In state 346, spurious reduction of production single_term -> mk_term(single_term_) 
## In state 336, spurious reduction of production separated_nonempty_list(COMMA,single_term) -> single_term 
## In state 382, spurious reduction of production comma_list1(single_term) -> separated_nonempty_list(COMMA,single_term) 
250 251 252 253 254 255
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: FORALL UNDERSCORE LEFTSQ UIDENT RIGHTSQ DONE 
##
256
## Ends in an error in state: 388.
257
##
258
## single_term_ -> quant comma_list1(quant_vars) triggers . DOT term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
259 260 261 262 263 264 265 266 267
##
## The known suffix of the stack is as follows:
## quant comma_list1(quant_vars) triggers 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: FORALL UNDERSCORE LEFTSQ WRITES 
##
268
## Ends in an error in state: 335.
269 270 271 272 273 274 275 276 277 278 279
##
## triggers -> LEFTSQ . separated_nonempty_list(BAR,comma_list1(single_term)) RIGHTSQ [ DOT ]
##
## The known suffix of the stack is as follows:
## LEFTSQ 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: FORALL UNDERSCORE WRITES 
##
280
## Ends in an error in state: 332.
281 282 283 284 285 286 287 288 289 290 291 292
##
## nonempty_list(binder_var) -> binder_var . [ LEFTSQ DOT COMMA COLON ]
## nonempty_list(binder_var) -> binder_var . nonempty_list(binder_var) [ LEFTSQ DOT COMMA COLON ]
##
## The known suffix of the stack is as follows:
## binder_var 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: FORALL WRITES 
##
293
## Ends in an error in state: 324.
294
##
295
## single_term_ -> quant . comma_list1(quant_vars) triggers DOT term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
296 297 298 299 300 301 302 303 304
##
## The known suffix of the stack is as follows:
## quant 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: FUN LEFTBRC RANGE WRITES 
##
305
## Ends in an error in state: 84.
306 307
##
## ty -> ty . ARROW ty [ RIGHTBRC ARROW ]
308
## ty_arg -> LEFTBRC ty . RIGHTBRC [ WRITES WITH VARIANT VAL USE UNDERSCORE UIDENT TYPE TO THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC RETURNS REQUIRES READS RANGE RAISES QUOTE_LIDENT PREDICATE POSITION OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LIDENT LET LEMMA LEFTSQ LEFTPAR LEFTBRC LARROW INVARIANT INDUCTIVE IN IMPORT GT GOAL FUNCTION FLOAT EXCEPTION EQUAL EOF ENSURES END ELSE DOWNTO DOTDOT DOT DONE DO DIVERGES CORE_UIDENT CORE_LIDENT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM ATTRIBUTE AT AS ARROW AND AMPAMP ALIAS ]
309 310 311 312 313 314 315 316
##
## The known suffix of the stack is as follows:
## LEFTBRC ty 
##
## WARNING: This example involves spurious reductions.
## This implies that, although the LR(1) items shown above provide an
## accurate view of the past (what has been recognized so far), they
## may provide an INCOMPLETE view of the future (what was expected next).
317 318
## In state 89, spurious reduction of production ty_arg -> lqualid 
## In state 83, spurious reduction of production ty -> ty_arg 
319 320 321 322 323 324
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: FUN LEFTBRC WRITES 
##
325
## Ends in an error in state: 77.
326
##
327
## ty_arg -> LEFTBRC . ty RIGHTBRC [ WRITES WITH VARIANT VAL USE UNDERSCORE UIDENT TYPE TO THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC RETURNS REQUIRES READS RANGE RAISES QUOTE_LIDENT PREDICATE POSITION OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LIDENT LET LEMMA LEFTSQ LEFTPAR LEFTBRC LARROW INVARIANT INDUCTIVE IN IMPORT GT GOAL FUNCTION FLOAT EXCEPTION EQUAL EOF ENSURES END ELSE DOWNTO DOTDOT DOT DONE DO DIVERGES CORE_UIDENT CORE_LIDENT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM ATTRIBUTE AT AS ARROW AND AMPAMP ALIAS ]
328 329 330 331 332 333 334 335 336
##
## The known suffix of the stack is as follows:
## LEFTBRC 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: FUN LEFTPAR GHOST RANGE WRITES 
##
337
## Ends in an error in state: 261.
338 339 340 341 342 343 344 345 346 347 348 349
##
## binder -> LEFTPAR GHOST ty . RIGHTPAR [ WRITES VARIANT UNDERSCORE UIDENT RETURNS REQUIRES READS RANGE RAISES QUOTE_LIDENT LIDENT LEFTPAR LEFTBRC FLOAT EQUAL ENSURES DIVERGES CORE_UIDENT CORE_LIDENT COLON ARROW ALIAS ]
## binder_vars_head -> ty . [ UNDERSCORE POSITION COLON ATTRIBUTE ]
## ty -> ty . ARROW ty [ UNDERSCORE RIGHTPAR POSITION COLON ATTRIBUTE ARROW ]
##
## The known suffix of the stack is as follows:
## LEFTPAR GHOST ty 
##
## WARNING: This example involves spurious reductions.
## This implies that, although the LR(1) items shown above provide an
## accurate view of the past (what has been recognized so far), they
## may provide an INCOMPLETE view of the future (what was expected next).
350 351
## In state 89, spurious reduction of production ty_arg -> lqualid 
## In state 83, spurious reduction of production ty -> ty_arg 
352 353 354 355 356 357
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: FUN LEFTPAR GHOST UNDERSCORE COLON CORE_LIDENT WRITES 
##
358
## Ends in an error in state: 266.
359 360 361 362 363 364 365 366 367 368
##
## binder -> LEFTPAR GHOST binder_vars cast . RIGHTPAR [ WRITES VARIANT UNDERSCORE UIDENT RETURNS REQUIRES READS RANGE RAISES QUOTE_LIDENT LIDENT LEFTPAR LEFTBRC FLOAT EQUAL ENSURES DIVERGES CORE_UIDENT CORE_LIDENT COLON ARROW ALIAS ]
##
## The known suffix of the stack is as follows:
## LEFTPAR GHOST binder_vars cast 
##
## WARNING: This example involves spurious reductions.
## This implies that, although the LR(1) items shown above provide an
## accurate view of the past (what has been recognized so far), they
## may provide an INCOMPLETE view of the future (what was expected next).
369 370 371
## In state 89, spurious reduction of production ty_arg -> lqualid 
## In state 83, spurious reduction of production ty -> ty_arg 
## In state 125, spurious reduction of production cast -> COLON ty 
372 373 374 375 376 377
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: FUN LEFTPAR GHOST WRITES 
##
378
## Ends in an error in state: 260.
379 380 381 382 383 384 385 386 387 388 389 390 391
##
## binder -> LEFTPAR GHOST . ty RIGHTPAR [ WRITES VARIANT UNDERSCORE UIDENT RETURNS REQUIRES READS RANGE RAISES QUOTE_LIDENT LIDENT LEFTPAR LEFTBRC FLOAT EQUAL ENSURES DIVERGES CORE_UIDENT CORE_LIDENT COLON ARROW ALIAS ]
## binder -> LEFTPAR GHOST . binder_vars_rest RIGHTPAR [ WRITES VARIANT UNDERSCORE UIDENT RETURNS REQUIRES READS RANGE RAISES QUOTE_LIDENT LIDENT LEFTPAR LEFTBRC FLOAT EQUAL ENSURES DIVERGES CORE_UIDENT CORE_LIDENT COLON ARROW ALIAS ]
## binder -> LEFTPAR GHOST . binder_vars cast RIGHTPAR [ WRITES VARIANT UNDERSCORE UIDENT RETURNS REQUIRES READS RANGE RAISES QUOTE_LIDENT LIDENT LEFTPAR LEFTBRC FLOAT EQUAL ENSURES DIVERGES CORE_UIDENT CORE_LIDENT COLON ARROW ALIAS ]
##
## The known suffix of the stack is as follows:
## LEFTPAR GHOST 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: FUN LEFTPAR RANGE COMMA RANGE COMMA WRITES 
##
392
## Ends in an error in state: 99.
393 394 395 396 397 398 399 400 401 402 403
##
## separated_nonempty_list(COMMA,ty) -> ty COMMA . separated_nonempty_list(COMMA,ty) [ RIGHTPAR ]
##
## The known suffix of the stack is as follows:
## ty COMMA 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: FUN LEFTPAR RANGE COMMA RANGE WRITES 
##
404
## Ends in an error in state: 98.
405 406 407 408 409 410 411 412 413 414 415 416
##
## separated_nonempty_list(COMMA,ty) -> ty . [ RIGHTPAR ]
## separated_nonempty_list(COMMA,ty) -> ty . COMMA separated_nonempty_list(COMMA,ty) [ RIGHTPAR ]
## ty -> ty . ARROW ty [ RIGHTPAR COMMA ARROW ]
##
## The known suffix of the stack is as follows:
## ty 
##
## WARNING: This example involves spurious reductions.
## This implies that, although the LR(1) items shown above provide an
## accurate view of the past (what has been recognized so far), they
## may provide an INCOMPLETE view of the future (what was expected next).
417 418
## In state 89, spurious reduction of production ty_arg -> lqualid 
## In state 83, spurious reduction of production ty -> ty_arg 
419 420 421 422 423 424
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: FUN LEFTPAR RANGE COMMA WRITES 
##
425
## Ends in an error in state: 97.
426 427 428 429 430 431 432 433 434
##
## comma_list2(ty) -> ty COMMA . comma_list1(ty) [ RIGHTPAR ]
##
## The known suffix of the stack is as follows:
## ty COMMA 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

435
term_comma_list_eof: FUN LEFTPAR RANGE POSITION WRITES 
436
##
437
## Ends in an error in state: 111.
438
##
439
## binder_vars_rest -> binder_vars_head nonempty_list(attr) . list(binder_var) [ RIGHTPAR COLON ]
440 441
##
## The known suffix of the stack is as follows:
442
## binder_vars_head nonempty_list(attr) 
443 444 445 446 447
##
## WARNING: This example involves spurious reductions.
## This implies that, although the LR(1) items shown above provide an
## accurate view of the past (what has been recognized so far), they
## may provide an INCOMPLETE view of the future (what was expected next).
448
## In state 119, spurious reduction of production nonempty_list(attr) -> attr 
449 450 451 452 453 454
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: FUN LEFTPAR RANGE UNDERSCORE WRITES 
##
455
## Ends in an error in state: 121.
456 457 458 459 460 461 462 463 464 465 466
##
## binder_vars_rest -> binder_vars_head anon_binder . list(binder_var) [ RIGHTPAR COLON ]
##
## The known suffix of the stack is as follows:
## binder_vars_head anon_binder 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: FUN LEFTPAR RANGE WRITES 
##
467
## Ends in an error in state: 130.
468 469 470 471
##
## binder_vars_head -> ty . [ UNDERSCORE POSITION COLON ATTRIBUTE ]
## comma_list2(ty) -> ty . COMMA comma_list1(ty) [ RIGHTPAR ]
## ty -> ty . ARROW ty [ UNDERSCORE RIGHTPAR POSITION COMMA COLON ATTRIBUTE ARROW ]
472
## ty_arg -> LEFTPAR ty . RIGHTPAR [ WRITES WITH VARIANT VAL USE UNDERSCORE UIDENT TYPE SCOPE RETURNS REQUIRES READS RANGE RAISES QUOTE_LIDENT PREDICATE META LIDENT LET LEMMA LEFTPAR LEFTBRC INVARIANT INDUCTIVE IN IMPORT GOAL FUNCTION FLOAT EXCEPTION EQUAL EOF ENSURES END DIVERGES CORE_UIDENT CORE_LIDENT CONSTANT COLON COINDUCTIVE CLONE BY BAR AXIOM ARROW ALIAS ]
473 474 475 476 477 478 479 480
##
## The known suffix of the stack is as follows:
## LEFTPAR ty 
##
## WARNING: This example involves spurious reductions.
## This implies that, although the LR(1) items shown above provide an
## accurate view of the past (what has been recognized so far), they
## may provide an INCOMPLETE view of the future (what was expected next).
481 482
## In state 89, spurious reduction of production ty_arg -> lqualid 
## In state 83, spurious reduction of production ty -> ty_arg 
483 484 485 486 487 488
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: FUN LEFTPAR UNDERSCORE COLON CORE_LIDENT WRITES 
##
489
## Ends in an error in state: 271.
490 491 492 493 494 495 496 497 498 499
##
## binder -> LEFTPAR binder_vars cast . RIGHTPAR [ WRITES VARIANT UNDERSCORE UIDENT RETURNS REQUIRES READS RANGE RAISES QUOTE_LIDENT LIDENT LEFTPAR LEFTBRC FLOAT EQUAL ENSURES DIVERGES CORE_UIDENT CORE_LIDENT COLON ARROW ALIAS ]
##
## The known suffix of the stack is as follows:
## LEFTPAR binder_vars cast 
##
## WARNING: This example involves spurious reductions.
## This implies that, although the LR(1) items shown above provide an
## accurate view of the past (what has been recognized so far), they
## may provide an INCOMPLETE view of the future (what was expected next).
500 501 502
## In state 89, spurious reduction of production ty_arg -> lqualid 
## In state 83, spurious reduction of production ty -> ty_arg 
## In state 125, spurious reduction of production cast -> COLON ty 
503 504 505 506 507 508
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: FUN LEFTPAR UNDERSCORE UNDERSCORE WRITES 
##
509
## Ends in an error in state: 115.
510 511 512 513 514 515 516 517 518 519 520
##
## list(binder_var) -> binder_var . list(binder_var) [ RIGHTPAR COLON ]
##
## The known suffix of the stack is as follows:
## binder_var 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: FUN LEFTPAR UNDERSCORE WRITES 
##
521
## Ends in an error in state: 128.
522 523 524 525 526 527 528 529 530 531 532
##
## binder_vars_rest -> anon_binder . list(binder_var) [ RIGHTPAR COLON ]
##
## The known suffix of the stack is as follows:
## anon_binder 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: FUN LEFTPAR WRITES 
##
533
## Ends in an error in state: 259.
534 535 536 537 538 539
##
## binder -> LEFTPAR . GHOST ty RIGHTPAR [ WRITES VARIANT UNDERSCORE UIDENT RETURNS REQUIRES READS RANGE RAISES QUOTE_LIDENT LIDENT LEFTPAR LEFTBRC FLOAT EQUAL ENSURES DIVERGES CORE_UIDENT CORE_LIDENT COLON ARROW ALIAS ]
## binder -> LEFTPAR . binder_vars_rest RIGHTPAR [ WRITES VARIANT UNDERSCORE UIDENT RETURNS REQUIRES READS RANGE RAISES QUOTE_LIDENT LIDENT LEFTPAR LEFTBRC FLOAT EQUAL ENSURES DIVERGES CORE_UIDENT CORE_LIDENT COLON ARROW ALIAS ]
## binder -> LEFTPAR . GHOST binder_vars_rest RIGHTPAR [ WRITES VARIANT UNDERSCORE UIDENT RETURNS REQUIRES READS RANGE RAISES QUOTE_LIDENT LIDENT LEFTPAR LEFTBRC FLOAT EQUAL ENSURES DIVERGES CORE_UIDENT CORE_LIDENT COLON ARROW ALIAS ]
## binder -> LEFTPAR . binder_vars cast RIGHTPAR [ WRITES VARIANT UNDERSCORE UIDENT RETURNS REQUIRES READS RANGE RAISES QUOTE_LIDENT LIDENT LEFTPAR LEFTBRC FLOAT EQUAL ENSURES DIVERGES CORE_UIDENT CORE_LIDENT COLON ARROW ALIAS ]
## binder -> LEFTPAR . GHOST binder_vars cast RIGHTPAR [ WRITES VARIANT UNDERSCORE UIDENT RETURNS REQUIRES READS RANGE RAISES QUOTE_LIDENT LIDENT LEFTPAR LEFTBRC FLOAT EQUAL ENSURES DIVERGES CORE_UIDENT CORE_LIDENT COLON ARROW ALIAS ]
540 541 542
## ty_arg -> LEFTPAR . comma_list2(ty) RIGHTPAR [ WRITES VARIANT UNDERSCORE UIDENT RETURNS REQUIRES READS RANGE RAISES QUOTE_LIDENT LIDENT LEFTPAR LEFTBRC FLOAT EQUAL ENSURES DIVERGES CORE_UIDENT CORE_LIDENT COLON ARROW ALIAS ]
## ty_arg -> LEFTPAR . RIGHTPAR [ WRITES VARIANT UNDERSCORE UIDENT RETURNS REQUIRES READS RANGE RAISES QUOTE_LIDENT LIDENT LEFTPAR LEFTBRC FLOAT EQUAL ENSURES DIVERGES CORE_UIDENT CORE_LIDENT COLON ARROW ALIAS ]
## ty_arg -> LEFTPAR . ty RIGHTPAR [ WRITES VARIANT UNDERSCORE UIDENT RETURNS REQUIRES READS RANGE RAISES QUOTE_LIDENT LIDENT LEFTPAR LEFTBRC FLOAT EQUAL ENSURES DIVERGES CORE_UIDENT CORE_LIDENT COLON ARROW ALIAS ]
543 544 545 546 547 548 549 550 551
##
## The known suffix of the stack is as follows:
## LEFTPAR 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: FUN UIDENT DOT WRITES 
##
552
## Ends in an error in state: 79.
553
##
554
## lqualid -> uqualid DOT . lident [ WRITES WITH VARIANT VAL USE UNDERSCORE UIDENT TYPE TO THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC RETURNS REQUIRES READS RANGE RAISES QUOTE_LIDENT PREDICATE POSITION OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LIDENT LET LEMMA LEFTSQ LEFTPAR LEFTBRC LARROW INVARIANT INDUCTIVE IN IMPORT GT GOAL FUNCTION FLOAT EXCEPTION EQUAL EOF ENSURES END ELSE DOWNTO DOTDOT DOT DONE DO DIVERGES CORE_UIDENT CORE_LIDENT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM ATTRIBUTE AT AS ARROW AND AMPAMP ALIAS ]
555 556 557 558 559 560 561 562 563 564
## uqualid -> uqualid DOT . uident [ DOT ]
##
## The known suffix of the stack is as follows:
## uqualid DOT 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: FUN UIDENT WRITES 
##
565
## Ends in an error in state: 78.
566
##
567
## lqualid -> uqualid . DOT lident [ WRITES WITH VARIANT VAL USE UNDERSCORE UIDENT TYPE TO THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC RETURNS REQUIRES READS RANGE RAISES QUOTE_LIDENT PREDICATE POSITION OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LIDENT LET LEMMA LEFTSQ LEFTPAR LEFTBRC LARROW INVARIANT INDUCTIVE IN IMPORT GT GOAL FUNCTION FLOAT EXCEPTION EQUAL EOF ENSURES END ELSE DOWNTO DOTDOT DOT DONE DO DIVERGES CORE_UIDENT CORE_LIDENT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM ATTRIBUTE AT AS ARROW AND AMPAMP ALIAS ]
568 569 570 571 572 573 574 575 576 577
## uqualid -> uqualid . DOT uident [ DOT ]
##
## The known suffix of the stack is as follows:
## uqualid 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: FUN UNDERSCORE ARROW WRITES 
##
578
## Ends in an error in state: 279.
579
##
580
## single_term_ -> FUN binders ARROW . term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
581 582 583 584 585 586 587 588 589
##
## The known suffix of the stack is as follows:
## FUN binders ARROW 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: FUN UNDERSCORE WITH 
##
590
## Ends in an error in state: 411.
591 592 593 594 595 596 597 598 599 600 601 602
##
## nonempty_list(binder) -> binder . [ WRITES VARIANT RETURNS REQUIRES READS RAISES EQUAL ENSURES DIVERGES COLON ARROW ALIAS ]
## nonempty_list(binder) -> binder . nonempty_list(binder) [ WRITES VARIANT RETURNS REQUIRES READS RAISES EQUAL ENSURES DIVERGES COLON ARROW ALIAS ]
##
## The known suffix of the stack is as follows:
## binder 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: FUN UNDERSCORE WRITES 
##
603
## Ends in an error in state: 278.
604
##
605
## single_term_ -> FUN binders . ARROW term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
606 607 608 609 610 611 612 613
##
## The known suffix of the stack is as follows:
## FUN binders 
##
## WARNING: This example involves spurious reductions.
## This implies that, although the LR(1) items shown above provide an
## accurate view of the past (what has been recognized so far), they
## may provide an INCOMPLETE view of the future (what was expected next).
614 615
## In state 411, spurious reduction of production nonempty_list(binder) -> binder 
## In state 274, spurious reduction of production binders -> nonempty_list(binder) 
616 617 618 619 620 621
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: FUN WRITES 
##
622
## Ends in an error in state: 258.
623
##
624
## single_term_ -> FUN . binders ARROW term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
625 626 627 628 629 630 631 632 633
##
## The known suffix of the stack is as follows:
## FUN 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: IF UIDENT THEN UIDENT ELSE WRITES 
##
634
## Ends in an error in state: 417.
635
##
636
## single_term_ -> IF term THEN term ELSE . term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
637 638 639 640 641 642 643 644 645
##
## The known suffix of the stack is as follows:
## IF term THEN term ELSE 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: IF UIDENT THEN UIDENT WITH 
##
646
## Ends in an error in state: 416.
647
##
648
## single_term_ -> IF term THEN term . ELSE term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
649 650 651 652 653 654 655 656
##
## The known suffix of the stack is as follows:
## IF term THEN term 
##
## WARNING: This example involves spurious reductions.
## This implies that, although the LR(1) items shown above provide an
## accurate view of the past (what has been recognized so far), they
## may provide an INCOMPLETE view of the future (what was expected next).
657 658 659 660 661 662 663
## In state 291, spurious reduction of production ident_rich -> uident 
## In state 349, spurious reduction of production qualid -> ident_rich 
## In state 339, spurious reduction of production term_arg_ -> qualid 
## In state 309, spurious reduction of production single_term_ -> term_arg_ 
## In state 315, spurious reduction of production mk_term(single_term_) -> single_term_ 
## In state 346, spurious reduction of production single_term -> mk_term(single_term_) 
## In state 316, spurious reduction of production term -> single_term 
664 665 666 667 668 669
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: IF UIDENT THEN WRITES 
##
670
## Ends in an error in state: 415.
671
##
672
## single_term_ -> IF term THEN . term ELSE term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
673 674 675 676 677 678 679 680 681
##
## The known suffix of the stack is as follows:
## IF term THEN 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: IF UIDENT WITH 
##
682
## Ends in an error in state: 414.
683
##
684
## single_term_ -> IF term . THEN term ELSE term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
685 686 687 688 689 690 691 692
##
## The known suffix of the stack is as follows:
## IF term 
##
## WARNING: This example involves spurious reductions.
## This implies that, although the LR(1) items shown above provide an
## accurate view of the past (what has been recognized so far), they
## may provide an INCOMPLETE view of the future (what was expected next).
693 694 695 696 697 698 699
## In state 291, spurious reduction of production ident_rich -> uident 
## In state 349, spurious reduction of production qualid -> ident_rich 
## In state 339, spurious reduction of production term_arg_ -> qualid 
## In state 309, spurious reduction of production single_term_ -> term_arg_ 
## In state 315, spurious reduction of production mk_term(single_term_) -> single_term_ 
## In state 346, spurious reduction of production single_term -> mk_term(single_term_) 
## In state 316, spurious reduction of production term -> single_term 
700 701 702 703 704 705
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: IF WRITES 
##
706
## Ends in an error in state: 257.
707
##
708
## single_term_ -> IF . term THEN term ELSE term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
709 710 711 712 713 714 715 716 717
##
## The known suffix of the stack is as follows:
## IF 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: LEFTBRC RANGE EQUAL UIDENT SEMICOLON WRITES 
##
718
## Ends in an error in state: 468.
719 720 721 722 723 724 725 726 727 728 729 730
##
## semicolon_list1(separated_pair(lqualid,EQUAL,term)) -> lqualid EQUAL term SEMICOLON . [ RIGHTBRC ]
## semicolon_list1(separated_pair(lqualid,EQUAL,term)) -> lqualid EQUAL term SEMICOLON . semicolon_list1(separated_pair(lqualid,EQUAL,term)) [ RIGHTBRC ]
##
## The known suffix of the stack is as follows:
## lqualid EQUAL term SEMICOLON 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: LEFTBRC RANGE EQUAL UIDENT WITH 
##
731
## Ends in an error in state: 467.
732 733 734 735 736 737 738 739 740 741 742 743
##
## semicolon_list1(separated_pair(lqualid,EQUAL,term)) -> lqualid EQUAL term . [ RIGHTBRC ]
## semicolon_list1(separated_pair(lqualid,EQUAL,term)) -> lqualid EQUAL term . SEMICOLON [ RIGHTBRC ]
## semicolon_list1(separated_pair(lqualid,EQUAL,term)) -> lqualid EQUAL term . SEMICOLON semicolon_list1(separated_pair(lqualid,EQUAL,term)) [ RIGHTBRC ]
##
## The known suffix of the stack is as follows:
## lqualid EQUAL term 
##
## WARNING: This example involves spurious reductions.
## This implies that, although the LR(1) items shown above provide an
## accurate view of the past (what has been recognized so far), they
## may provide an INCOMPLETE view of the future (what was expected next).
744 745 746 747 748 749 750
## In state 291, spurious reduction of production ident_rich -> uident 
## In state 349, spurious reduction of production qualid -> ident_rich 
## In state 339, spurious reduction of production term_arg_ -> qualid 
## In state 309, spurious reduction of production single_term_ -> term_arg_ 
## In state 315, spurious reduction of production mk_term(single_term_) -> single_term_ 
## In state 346, spurious reduction of production single_term -> mk_term(single_term_) 
## In state 316, spurious reduction of production term -> single_term 
751 752 753 754 755 756
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: LEFTBRC RANGE EQUAL WRITES 
##
757
## Ends in an error in state: 466.
758 759 760 761 762 763 764 765 766 767 768 769 770
##
## semicolon_list1(separated_pair(lqualid,EQUAL,term)) -> lqualid EQUAL . term [ RIGHTBRC ]
## semicolon_list1(separated_pair(lqualid,EQUAL,term)) -> lqualid EQUAL . term SEMICOLON [ RIGHTBRC ]
## semicolon_list1(separated_pair(lqualid,EQUAL,term)) -> lqualid EQUAL . term SEMICOLON semicolon_list1(separated_pair(lqualid,EQUAL,term)) [ RIGHTBRC ]
##
## The known suffix of the stack is as follows:
## lqualid EQUAL 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: LEFTBRC RANGE WRITES 
##
771
## Ends in an error in state: 473.
772 773 774 775 776 777 778 779 780 781 782 783
##
## ident_rich -> lident . [ WITH RIGHTBRC LEFTSQ ]
## lqualid -> lident . [ EQUAL DOT ]
##
## The known suffix of the stack is as follows:
## lident 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: LEFTBRC UIDENT DOT RANGE WRITES 
##
784
## Ends in an error in state: 461.
785 786 787 788 789 790 791 792 793 794 795 796
##
## ident_rich -> lident . [ WITH RIGHTBRC LEFTSQ ]
## lqualid -> uqualid DOT lident . [ EQUAL DOT ]
##
## The known suffix of the stack is as follows:
## uqualid DOT lident 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: LEFTBRC UIDENT DOT WRITES 
##
797
## Ends in an error in state: 460.
798 799 800 801 802 803 804 805 806 807 808 809 810 811
##
## lqualid -> uqualid DOT . lident [ EQUAL DOT ]
## qualid -> uqualid DOT . ident_rich [ WITH LEFTSQ ]
## term_sub_ -> uqualid DOT . mk_term(term_block) [ WITH LEFTSQ DOT ]
## uqualid -> uqualid DOT . uident [ DOT ]
##
## The known suffix of the stack is as follows:
## uqualid DOT 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: LEFTBRC UIDENT WITH RANGE WRITES 
##
812
## Ends in an error in state: 465.
813 814 815 816 817 818 819 820 821 822 823 824 825
##
## semicolon_list1(separated_pair(lqualid,EQUAL,term)) -> lqualid . EQUAL term [ RIGHTBRC ]
## semicolon_list1(separated_pair(lqualid,EQUAL,term)) -> lqualid . EQUAL term SEMICOLON [ RIGHTBRC ]
## semicolon_list1(separated_pair(lqualid,EQUAL,term)) -> lqualid . EQUAL term SEMICOLON semicolon_list1(separated_pair(lqualid,EQUAL,term)) [ RIGHTBRC ]
##
## The known suffix of the stack is as follows:
## lqualid 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: LEFTBRC UIDENT WITH WRITES 
##
826
## Ends in an error in state: 463.
827
##
828
## term_block -> LEFTBRC term_arg WITH . field_list1(term) RIGHTBRC [ WITH VAL USE UIDENT TYPE TRUE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC REAL RANGE PREDICATE OR OPPREF OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LIDENT LET LEMMA LEFTSQ LEFTPAR LEFTBRC LARROW INTEGER INDUCTIVE IN IMPORT GT GOAL FUNCTION FLOAT FALSE EXCEPTION EQUAL EOF END ELSE DOTDOT DOT CORE_UIDENT CORE_LIDENT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BEGIN BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
829 830 831 832 833 834 835 836 837
##
## The known suffix of the stack is as follows:
## LEFTBRC term_arg WITH 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: LEFTBRC UIDENT WRITES 
##
838
## Ends in an error in state: 462.
839
##
840 841 842 843 844 845
## term_block -> LEFTBRC term_arg . WITH field_list1(term) RIGHTBRC [ WITH VAL USE UIDENT TYPE TRUE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC REAL RANGE PREDICATE OR OPPREF OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LIDENT LET LEMMA LEFTSQ LEFTPAR LEFTBRC LARROW INTEGER INDUCTIVE IN IMPORT GT GOAL FUNCTION FLOAT FALSE EXCEPTION EQUAL EOF END ELSE DOTDOT DOT CORE_UIDENT CORE_LIDENT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BEGIN BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## term_sub_ -> term_arg . LEFTSQ term rightsq [ WITH LEFTSQ DOT ]
## term_sub_ -> term_arg . LEFTSQ term LARROW term rightsq [ WITH LEFTSQ DOT ]
## term_sub_ -> term_arg . LEFTSQ term DOTDOT term rightsq [ WITH LEFTSQ DOT ]
## term_sub_ -> term_arg . LEFTSQ term DOTDOT rightsq [ WITH LEFTSQ DOT ]
## term_sub_ -> term_arg . LEFTSQ DOTDOT term rightsq [ WITH LEFTSQ DOT ]
846 847 848 849 850 851 852 853
##
## The known suffix of the stack is as follows:
## LEFTBRC term_arg 
##
## WARNING: This example involves spurious reductions.
## This implies that, although the LR(1) items shown above provide an
## accurate view of the past (what has been recognized so far), they
## may provide an INCOMPLETE view of the future (what was expected next).
854 855 856 857 858
## In state 291, spurious reduction of production ident_rich -> uident 
## In state 349, spurious reduction of production qualid -> ident_rich 
## In state 339, spurious reduction of production term_arg_ -> qualid 
## In state 405, spurious reduction of production mk_term(term_arg_) -> term_arg_ 
## In state 345, spurious reduction of production term_arg -> mk_term(term_arg_) 
859 860 861 862 863 864
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: LEFTBRC WRITES 
##
865
## Ends in an error in state: 197.
866
##
867 868
## term_block -> LEFTBRC . field_list1(term) RIGHTBRC [ WITH VAL USE UIDENT TYPE TRUE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC REAL RANGE PREDICATE OR OPPREF OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LIDENT LET LEMMA LEFTSQ LEFTPAR LEFTBRC LARROW INTEGER INDUCTIVE IN IMPORT GT GOAL FUNCTION FLOAT FALSE EXCEPTION EQUAL EOF END ELSE DOTDOT DOT CORE_UIDENT CORE_LIDENT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BEGIN BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## term_block -> LEFTBRC . term_arg WITH field_list1(term) RIGHTBRC [ WITH VAL USE UIDENT TYPE TRUE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC REAL RANGE PREDICATE OR OPPREF OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LIDENT LET LEMMA LEFTSQ LEFTPAR LEFTBRC LARROW INTEGER INDUCTIVE IN IMPORT GT GOAL FUNCTION FLOAT FALSE EXCEPTION EQUAL EOF END ELSE DOTDOT DOT CORE_UIDENT CORE_LIDENT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BEGIN BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
869 870 871 872 873 874 875 876 877
##
## The known suffix of the stack is as follows:
## LEFTBRC 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: LEFTPAR MINUS WRITES 
##
878
## Ends in an error in state: 478.
879
##
880 881
## lident_op_str -> MINUS . UNDERSCORE [ RIGHTPAR_USCORE RIGHTPAR_QUOTE RIGHTPAR ]
## lident_op_str -> MINUS . [ RIGHTPAR_USCORE RIGHTPAR_QUOTE RIGHTPAR ]
882 883 884 885 886 887 888 889 890 891 892 893
## prefix_op -> MINUS . [ UIDENT TRUE REAL RANGE POSITION OPPREF OP4 OP3 OP2 OP1 OLD NOT MINUS MATCH LT LIDENT LET LEFTPAR LEFTBRC INTEGER IF GT FUN FORALL FLOAT FALSE EXISTS EPSILON CORE_UIDENT CORE_LIDENT BEGIN ATTRIBUTE ]
## single_term_ -> MINUS . INTEGER [ SO RIGHTPAR OR OP4 OP3 OP2 OP1 MINUS LTGT LT LRARROW GT EQUAL COMMA COLON BY BARBAR AT ARROW AND AMPAMP ]
## single_term_ -> MINUS . REAL [ SO RIGHTPAR OR OP4 OP3 OP2 OP1 MINUS LTGT LT LRARROW GT EQUAL COMMA COLON BY BARBAR AT ARROW AND AMPAMP ]
##
## The known suffix of the stack is as follows:
## MINUS 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: LEFTPAR OP4 WRITES 
##
894
## Ends in an error in state: 481.
895
##
896 897
## lident_op_str -> op_symbol . [ RIGHTPAR_USCORE RIGHTPAR_QUOTE RIGHTPAR ]
## lident_op_str -> op_symbol . UNDERSCORE [ RIGHTPAR_USCORE RIGHTPAR_QUOTE RIGHTPAR ]
898 899 900 901 902 903 904 905 906 907
## prefix_op -> op_symbol . [ WHILE VAL UIDENT TRY TRUE RETURN REAL RANGE RAISE PURE POSITION OPPREF OP4 OP3 OP2 OP1 OLD NOT MINUS MATCH LT LIDENT LET LEFTPAR LEFTBRC LABEL INTEGER IF GT GHOST FUN FORALL FOR FLOAT FALSE EXISTS EXCEPTION EPSILON CORE_UIDENT CORE_LIDENT CONTINUE CHECK BREAK BEGIN ATTRIBUTE ASSUME ASSERT ANY ABSURD ]
##
## The known suffix of the stack is as follows:
## op_symbol 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: LEFTPAR OPPREF WRITES 
##
908
## Ends in an error in state: 196.
909
##
910
## lident_op_str -> OPPREF . option(UNDERSCORE) [ RIGHTPAR_USCORE RIGHTPAR_QUOTE RIGHTPAR ]
911 912 913 914 915 916 917 918 919 920 921
## term_arg_ -> OPPREF . term_arg [ UIDENT TRUE SO RIGHTPAR REAL RANGE OR OPPREF OP4 OP3 OP2 OP1 MINUS LTGT LT LRARROW LIDENT LEFTSQ LEFTPAR LEFTBRC INTEGER GT FLOAT FALSE EQUAL CORE_UIDENT CORE_LIDENT COMMA COLON BY BEGIN BARBAR AT ARROW AND AMPAMP ]
## term_dot_ -> OPPREF . term_dot [ DOT ]
##
## The known suffix of the stack is as follows:
## OPPREF 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: LEFTPAR RIGHTPAR WRITES 
##
922
## Ends in an error in state: 292.
923
##
924
## term_arg_ -> term_sub_ . [ WITH VAL USE UIDENT TYPE TRUE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC REAL RANGE PREDICATE OR OPPREF OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LIDENT LET LEMMA LEFTSQ LEFTPAR LEFTBRC LARROW INTEGER INDUCTIVE IN IMPORT GT GOAL FUNCTION FLOAT FALSE EXCEPTION EQUAL EOF END ELSE DOTDOT CORE_UIDENT CORE_LIDENT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BEGIN BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
925 926 927 928 929 930 931 932 933 934
## term_dot_ -> term_sub_ . [ DOT ]
##
## The known suffix of the stack is as follows:
## term_sub_ 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: LEFTPAR UIDENT WITH 
##
935
## Ends in an error in state: 479.
936
##
937
## term_block -> LEFTPAR term . RIGHTPAR [ WITH VAL USE UIDENT TYPE TRUE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC REAL RANGE PREDICATE OR OPPREF OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LIDENT LET LEMMA LEFTSQ LEFTPAR LEFTBRC LARROW INTEGER INDUCTIVE IN IMPORT GT GOAL FUNCTION FLOAT FALSE EXCEPTION EQUAL EOF END ELSE DOTDOT DOT CORE_UIDENT CORE_LIDENT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BEGIN BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
938 939 940 941 942 943 944 945
##
## The known suffix of the stack is as follows:
## LEFTPAR term 
##
## WARNING: This example involves spurious reductions.
## This implies that, although the LR(1) items shown above provide an
## accurate view of the past (what has been recognized so far), they
## may provide an INCOMPLETE view of the future (what was expected next).
946 947 948 949 950 951 952
## In state 291, spurious reduction of production ident_rich -> uident 
## In state 349, spurious reduction of production qualid -> ident_rich 
## In state 339, spurious reduction of production term_arg_ -> qualid 
## In state 309, spurious reduction of production single_term_ -> term_arg_ 
## In state 315, spurious reduction of production mk_term(single_term_) -> single_term_ 
## In state 346, spurious reduction of production single_term -> mk_term(single_term_) 
## In state 316, spurious reduction of production term -> single_term 
953 954 955 956 957 958
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: LEFTPAR WRITES 
##
959
## Ends in an error in state: 194.
960
##
961
## lident_op -> LEFTPAR . lident_op_str RIGHTPAR [ WITH VAL USE UIDENT TYPE TRUE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC REAL RANGE PREDICATE OR OPPREF OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LIDENT LET LEMMA LEFTSQ LEFTPAR LEFTBRC LARROW INTEGER INDUCTIVE IN IMPORT GT GOAL FUNCTION FLOAT FALSE EXCEPTION EQUAL EOF END ELSE DOTDOT CORE_UIDENT CORE_LIDENT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BEGIN BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
962
## lident_op -> LEFTPAR . lident_op_str RIGHTPAR_USCORE [ WITH VAL USE UIDENT TYPE TRUE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC REAL RANGE PREDICATE OR OPPREF OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LIDENT LET LEMMA LEFTSQ LEFTPAR LEFTBRC LARROW INTEGER INDUCTIVE IN IMPORT GT GOAL FUNCTION FLOAT FALSE EXCEPTION EQUAL EOF END ELSE DOTDOT CORE_UIDENT CORE_LIDENT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BEGIN BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
963 964 965
## lident_op -> LEFTPAR . lident_op_str RIGHTPAR_QUOTE [ WITH VAL USE UIDENT TYPE TRUE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC REAL RANGE PREDICATE OR OPPREF OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LIDENT LET LEMMA LEFTSQ LEFTPAR LEFTBRC LARROW INTEGER INDUCTIVE IN IMPORT GT GOAL FUNCTION FLOAT FALSE EXCEPTION EQUAL EOF END ELSE DOTDOT CORE_UIDENT CORE_LIDENT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BEGIN BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## term_block -> LEFTPAR . term RIGHTPAR [ WITH VAL USE UIDENT TYPE TRUE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC REAL RANGE PREDICATE OR OPPREF OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LIDENT LET LEMMA LEFTSQ LEFTPAR LEFTBRC LARROW INTEGER INDUCTIVE IN IMPORT GT GOAL FUNCTION FLOAT FALSE EXCEPTION EQUAL EOF END ELSE DOTDOT DOT CORE_UIDENT CORE_LIDENT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BEGIN BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## term_block -> LEFTPAR . RIGHTPAR [ WITH VAL USE UIDENT TYPE TRUE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC REAL RANGE PREDICATE OR OPPREF OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LIDENT LET LEMMA LEFTSQ LEFTPAR LEFTBRC LARROW INTEGER INDUCTIVE IN IMPORT GT GOAL FUNCTION FLOAT FALSE EXCEPTION EQUAL EOF END ELSE DOTDOT DOT CORE_UIDENT CORE_LIDENT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BEGIN BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
966 967 968 969 970 971 972 973 974
##
## The known suffix of the stack is as follows:
## LEFTPAR 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: LET GHOST WRITES 
##
975
## Ends in an error in state: 216.
976
##
977
## pat_uni_ -> GHOST . mk_pat(pat_uni_) [ SEMICOLON RIGHTPAR RIGHTBRC EQUAL COMMA COLON BAR AS ARROW ]
978 979 980 981 982 983 984 985 986
##
## The known suffix of the stack is as follows:
## GHOST 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: LET LEFTBRC RANGE EQUAL UNDERSCORE RIGHTPAR 
##
987
## Ends in an error in state: 231.
988 989 990 991 992 993 994 995 996 997 998 999
##
## semicolon_list1(separated_pair(lqualid,EQUAL,pattern)) -> lqualid EQUAL pattern . [ RIGHTBRC ]
## semicolon_list1(separated_pair(lqualid,EQUAL,pattern)) -> lqualid EQUAL pattern . SEMICOLON [ RIGHTBRC ]
## semicolon_list1(separated_pair(lqualid,EQUAL,pattern)) -> lqualid EQUAL pattern . SEMICOLON semicolon_list1(separated_pair(lqualid,EQUAL,pattern)) [ RIGHTBRC ]
##
## The known suffix of the stack is as follows:
## lqualid EQUAL pattern 
##
## WARNING: This example involves spurious reductions.
## This implies that, although the LR(1) items shown above provide an
## accurate view of the past (what has been recognized so far), they
## may provide an INCOMPLETE view of the future (what was expected next).
1000 1001 1002 1003
## In state 234, spurious reduction of production pat_conj_ -> pat_uni_ 
## In state 235, spurious reduction of production pattern_ -> pat_conj_ 
## In state 230, spurious reduction of production mk_pat(pattern_) -> pattern_ 
## In state 236, spurious reduction of production pattern -> mk_pat(pattern_) 
1004 1005 1006 1007 1008 1009
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: LET LEFTBRC RANGE EQUAL UNDERSCORE SEMICOLON WRITES 
##
1010
## Ends in an error in state: 232.
1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022
##
## semicolon_list1(separated_pair(lqualid,EQUAL,pattern)) -> lqualid EQUAL pattern SEMICOLON . [ RIGHTBRC ]
## semicolon_list1(separated_pair(lqualid,EQUAL,pattern)) -> lqualid EQUAL pattern SEMICOLON . semicolon_list1(separated_pair(lqualid,EQUAL,pattern)) [ RIGHTBRC ]
##
## The known suffix of the stack is as follows:
## lqualid EQUAL pattern SEMICOLON 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: LET LEFTBRC RANGE EQUAL WRITES 
##
1023
## Ends in an error in state: 215.
1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036
##
## semicolon_list1(separated_pair(lqualid,EQUAL,pattern)) -> lqualid EQUAL . pattern [ RIGHTBRC ]
## semicolon_list1(separated_pair(lqualid,EQUAL,pattern)) -> lqualid EQUAL . pattern SEMICOLON [ RIGHTBRC ]
## semicolon_list1(separated_pair(lqualid,EQUAL,pattern)) -> lqualid EQUAL . pattern SEMICOLON semicolon_list1(separated_pair(lqualid,EQUAL,pattern)) [ RIGHTBRC ]
##
## The known suffix of the stack is as follows:
## lqualid EQUAL 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: LET LEFTBRC RANGE WRITES 
##
1037
## Ends in an error in state: 214.
1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050
##
## semicolon_list1(separated_pair(lqualid,EQUAL,pattern)) -> lqualid . EQUAL pattern [ RIGHTBRC ]
## semicolon_list1(separated_pair(lqualid,EQUAL,pattern)) -> lqualid . EQUAL pattern SEMICOLON [ RIGHTBRC ]
## semicolon_list1(separated_pair(lqualid,EQUAL,pattern)) -> lqualid . EQUAL pattern SEMICOLON semicolon_list1(separated_pair(lqualid,EQUAL,pattern)) [ RIGHTBRC ]
##
## The known suffix of the stack is as follows:
## lqualid 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: LET LEFTBRC WRITES 
##
1051
## Ends in an error in state: 212.
1052
##
1053
## pat_arg_ -> LEFTBRC . field_list1(pattern) RIGHTBRC [ UNDERSCORE UIDENT SEMICOLON RIGHTPAR RIGHTBRC RANGE LIDENT LEFTPAR LEFTBRC FLOAT EQUAL CORE_UIDENT CORE_LIDENT COMMA COLON BAR AS ARROW ]
1054 1055 1056 1057 1058 1059 1060 1061 1062
##
## The known suffix of the stack is as follows:
## LEFTBRC 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: LET LEFTPAR OPPREF RIGHTPAR EQUAL UIDENT IN WRITES 
##
1063
## Ends in an error in state: 427.
1064
##
1065
## single_term_ -> LET attrs(lident_op_nq) EQUAL term IN . term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
1066 1067
##
## The known suffix of the stack is as follows:
1068
## LET attrs(lident_op_nq) EQUAL term IN 
1069 1070 1071 1072 1073 1074
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: LET LEFTPAR OPPREF RIGHTPAR EQUAL UIDENT WITH 
##
1075
## Ends in an error in state: 426.
1076
##
1077
## single_term_ -> LET attrs(lident_op_nq) EQUAL term . IN term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
1078 1079
##
## The known suffix of the stack is as follows:
1080
## LET attrs(lident_op_nq) EQUAL term 
1081 1082 1083 1084 1085
##
## WARNING: This example involves spurious reductions.
## This implies that, although the LR(1) items shown above provide an
## accurate view of the past (what has been recognized so far), they
## may provide an INCOMPLETE view of the future (what was expected next).
1086 1087 1088 1089 1090 1091 1092
## In state 291, spurious reduction of production ident_rich -> uident 
## In state 349, spurious reduction of production qualid -> ident_rich 
## In state 339, spurious reduction of production term_arg_ -> qualid 
## In state 309, spurious reduction of production single_term_ -> term_arg_ 
## In state 315, spurious reduction of production mk_term(single_term_) -> single_term_ 
## In state 346, spurious reduction of production single_term -> mk_term(single_term_) 
## In state 316, spurious reduction of production term -> single_term 
1093 1094 1095 1096 1097 1098
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: LET LEFTPAR OPPREF RIGHTPAR EQUAL WRITES 
##
1099
## Ends in an error in state: 425.
1100
##
1101
## single_term_ -> LET attrs(lident_op_nq) EQUAL . term IN term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
1102 1103
##
## The known suffix of the stack is as follows:
1104
## LET attrs(lident_op_nq) EQUAL 
1105 1106 1107 1108 1109 1110
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: LET LEFTPAR OPPREF RIGHTPAR POSITION WRITES 
##
1111
## Ends in an error in state: 424.
1112
##
1113 1114
## single_term_ -> LET attrs(lident_op_nq) . EQUAL term IN term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
## single_term_ -> LET attrs(lident_op_nq) . mk_term(lam_defn) IN term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
1115 1116
##
## The known suffix of the stack is as follows:
1117
## LET attrs(lident_op_nq) 
1118 1119 1120 1121 1122
##
## WARNING: This example involves spurious reductions.
## This implies that, although the LR(1) items shown above provide an
## accurate view of the past (what has been recognized so far), they
## may provide an INCOMPLETE view of the future (what was expected next).
1123 1124 1125
## In state 65, spurious reduction of production list(attr) -> 
## In state 66, spurious reduction of production list(attr) -> attr list(attr) 
## In state 423, spurious reduction of production attrs(lident_op_nq) -> lident_op_nq list(attr) 
1126 1127 1128 1129 1130 1131
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: LET LEFTPAR OPPREF RIGHTPAR UNDERSCORE EQUAL CORE_LIDENT IN WRITES 
##
1132
## Ends in an error in state: 430.
1133
##
1134
## single_term_ -> LET attrs(lident_op_nq) mk_term(lam_defn) IN . term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
1135 1136
##
## The known suffix of the stack is as follows:
1137
## LET attrs(lident_op_nq) mk_term(lam_defn) IN 
1138 1139 1140 1141 1142 1143
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: LET LEFTPAR OPPREF RIGHTPAR UNDERSCORE EQUAL CORE_LIDENT WITH 
##
1144
## Ends in an error in state: 429.
1145
##
1146
## single_term_ -> LET attrs(lident_op_nq) mk_term(lam_defn) . IN term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
1147 1148
##
## The known suffix of the stack is as follows:
1149
## LET attrs(lident_op_nq) mk_term(lam_defn) 
1150 1151 1152 1153 1154
##
## WARNING: This example involves spurious reductions.
## This implies that, although the LR(1) items shown above provide an
## accurate view of the past (what has been recognized so far), they
## may provide an INCOMPLETE view of the future (what was expected next).
1155 1156 1157 1158 1159 1160 1161 1162 1163
## In state 348, spurious reduction of production ident_rich -> lident 
## In state 349, spurious reduction of production qualid -> ident_rich 
## In state 339, spurious reduction of production term_arg_ -> qualid 
## In state 309, spurious reduction of production single_term_ -> term_arg_ 
## In state 315, spurious reduction of production mk_term(single_term_) -> single_term_ 
## In state 346, spurious reduction of production single_term -> mk_term(single_term_) 
## In state 316, spurious reduction of production term -> single_term 
## In state 435, spurious reduction of production lam_defn -> binders EQUAL term 
## In state 432, spurious reduction of production mk_term(lam_defn) -> lam_defn 
1164 1165 1166 1167 1168 1169
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: LET LEFTPAR OPPREF RIGHTPAR WRITES 
##
1170
## Ends in an error in state: 422.
1171
##
1172
## attrs(lident_op_nq) -> lident_op_nq . list(attr) [ UNDERSCORE UIDENT RANGE QUOTE_LIDENT LIDENT LEFTPAR LEFTBRC FLOAT EQUAL CORE_UIDENT CORE_LIDENT ]
1173 1174
##
## The known suffix of the stack is as follows:
1175
## lident_op_nq 
1176 1177 1178 1179 1180 1181
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: LET LEFTPAR UNDERSCORE SEMICOLON 
##
1182
## Ends in an error in state: 253.
1183
##
1184
## pat_arg_ -> LEFTPAR pattern . RIGHTPAR [ UNDERSCORE UIDENT SEMICOLON RIGHTPAR RIGHTBRC RANGE LIDENT LEFTPAR LEFTBRC FLOAT EQUAL CORE_UIDENT CORE_LIDENT COMMA COLON BAR AS ARROW ]
1185 1186
##
## The known suffix of the stack is as follows:
1187
## LEFTPAR pattern 
1188 1189 1190 1191 1192
##
## WARNING: This example involves spurious reductions.
## This implies that, although the LR(1) items shown above provide an
## accurate view of the past (what has been recognized so far), they
## may provide an INCOMPLETE view of the future (what was expected next).
1193 1194 1195 1196
## In state 234, spurious reduction of production pat_conj_ -> pat_uni_ 
## In state 235, spurious reduction of production pattern_ -> pat_conj_ 
## In state 230, spurious reduction of production mk_pat(pattern_) -> pattern_ 
## In state 236, spurious reduction of production pattern -> mk_pat(pattern_) 
1197 1198 1199 1200 1201 1202
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: LET LEFTPAR WRITES 
##
1203
## Ends in an error in state: 209.
1204
##
1205
## lident_op_nq -> LEFTPAR . lident_op_str RIGHTPAR [ UNDERSCORE UIDENT RANGE QUOTE_LIDENT POSITION LIDENT LEFTPAR LEFTBRC FLOAT EQUAL CORE_UIDENT CORE_LIDENT ATTRIBUTE ]
1206
## lident_op_nq -> LEFTPAR . lident_op_str RIGHTPAR_USCORE [ UNDERSCORE UIDENT RANGE QUOTE_LIDENT POSITION LIDENT LEFTPAR LEFTBRC FLOAT EQUAL CORE_UIDENT CORE_LIDENT ATTRIBUTE ]
1207
## lident_op_nq -> LEFTPAR . lident_op_str RIGHTPAR_QUOTE [ UNDERSCORE UIDENT RANGE QUOTE_LIDENT POSITION LIDENT LEFTPAR LEFTBRC FLOAT EQUAL CORE_UIDENT CORE_LIDENT ATTRIBUTE ]
1208 1209
## pat_arg_ -> LEFTPAR . RIGHTPAR [ EQUAL COMMA COLON BAR AS ]
## pat_arg_ -> LEFTPAR . pattern RIGHTPAR [ EQUAL COMMA COLON BAR AS ]
1210 1211 1212 1213 1214 1215 1216 1217 1218
##
## The known suffix of the stack is as follows:
## LEFTPAR 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: LET RANGE UNDERSCORE EQUAL CORE_LIDENT IN WRITES 
##
1219
## Ends in an error in state: 438.
1220
##
1221
## single_term_ -> LET attrs(lident_nq) mk_term(lam_defn) IN . term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
1222 1223
##
## The known suffix of the stack is as follows:
Andrei Paskevich's avatar
Andrei Paskevich committed
1224
## LET attrs(lident_nq) mk_term(lam_defn) IN 
1225 1226 1227 1228 1229 1230
##

<YOUR SYNTAX ERROR MESSAGE HERE>

term_comma_list_eof: LET RANGE UNDERSCORE EQUAL CORE_LIDENT WITH 
##
1231
## Ends in an error in state: 437.
1232
##
1233
## single_term_ -> LET attrs(lident_nq) mk_term(lam_defn) . IN term [ WITH VAL USE TYPE THEN SO SEMICOLON SCOPE RIGHTSQ_QUOTE RIGHTSQ RIGHTPAR RIGHTBRC PREDICATE OR OP4 OP3 OP2 OP1 MINUS META LTGT LT LRARROW LET LEMMA LARROW INDUCTIVE IN IMPORT GT GOAL FUNCTION EXCEPTION EQUAL EOF END ELSE DOTDOT CONSTANT COMMA COLON COINDUCTIVE CLONE BY BARBAR BAR AXIOM AT ARROW AND AMPAMP ]
1234 1235
##
## The known suffix of the stack is as follows:
Andrei Paskevich's avatar
Andrei Paskevich committed
1236
## LET attrs(lident_nq) mk_term(lam_defn) 
1237 1238 1239 1240 1241
##
## WARNING: This example involves spurious reductions.
## This implies that, although the LR(1) items shown above provide an
## accurate view of the past (what has been recognized so far), they
## may provide an INCOMPLETE view of the future (what was expected next).
1242 1243 1244 1245 1246 1247 1248 1249 1250
## In state 348, spurious reduction of production ident_rich -> lident 
## In state 349, spurious reduction of production qualid -> ident_rich 
## In state 339, spurious reduction of production term_arg_ -> qualid 
## In state 309, spurious reduction of production single_term_ -> term_arg_ 
## In state 315, spurious reduction of production mk_term(single_term_) -> single_term_ 
## In state 346, spurious reduction of production single_term -> mk_term(single_term_) 
## In state 316, spurious reduction of production term -> single_term 
## In state 435, spurious reduction of production lam_defn -> binders EQUAL term 
## In state 432, spurious reduction of production mk_term(lam_defn) -> lam_defn 
1251 </