interactive_expr: BigMap LBRACKET Unit ARROW Bytes End
##
## Ends in an error in state: 151.
##
## injection(BigMap,binding) -> BigMap LBRACKET sep_or_term_list(binding,SEMI) . RBRACKET [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## BigMap LBRACKET sep_or_term_list(binding,SEMI)
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
## In state 248, spurious reduction of production binding -> expr ARROW expr 
## In state 249, spurious reduction of production nsepseq(binding,SEMI) -> binding 
## In state 245, spurious reduction of production sep_or_term_list(binding,SEMI) -> nsepseq(binding,SEMI) 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: BigMap LBRACKET With
##
## Ends in an error in state: 144.
##
## injection(BigMap,binding) -> BigMap LBRACKET . sep_or_term_list(binding,SEMI) RBRACKET [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
## injection(BigMap,binding) -> BigMap LBRACKET . RBRACKET [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## BigMap LBRACKET
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: BigMap Unit ARROW Bytes RBRACKET
##
## Ends in an error in state: 257.
##
## injection(BigMap,binding) -> BigMap sep_or_term_list(binding,SEMI) . End [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## BigMap sep_or_term_list(binding,SEMI)
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
## In state 248, spurious reduction of production binding -> expr ARROW expr 
## In state 249, spurious reduction of production nsepseq(binding,SEMI) -> binding 
## In state 245, spurious reduction of production sep_or_term_list(binding,SEMI) -> nsepseq(binding,SEMI) 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: BigMap With
##
## Ends in an error in state: 143.
##
## injection(BigMap,binding) -> BigMap . sep_or_term_list(binding,SEMI) End [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
## injection(BigMap,binding) -> BigMap . End [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
## injection(BigMap,binding) -> BigMap . LBRACKET sep_or_term_list(binding,SEMI) RBRACKET [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
## injection(BigMap,binding) -> BigMap . LBRACKET RBRACKET [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## BigMap
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: C_Some With
##
## Ends in an error in state: 139.
##
## core_expr -> C_Some . arguments [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## C_Some
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Case Unit Of C_Some LPAR WILD With
##
## Ends in an error in state: 285.
##
## par(core_pattern) -> LPAR core_pattern . RPAR [ SEMI RPAR RBRACKET End CONS COMMA ARROW ]
##
## The known suffix of the stack is as follows:
## LPAR core_pattern
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Case Unit Of C_Some LPAR With
##
## Ends in an error in state: 277.
##
## par(core_pattern) -> LPAR . core_pattern RPAR [ SEMI RPAR RBRACKET End CONS COMMA ARROW ]
##
## The known suffix of the stack is as follows:
## LPAR
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Case Unit Of C_Some With
##
## Ends in an error in state: 276.
##
## constr_pattern -> C_Some . par(core_pattern) [ SEMI RPAR RBRACKET End CONS COMMA ARROW ]
##
## The known suffix of the stack is as follows:
## C_Some
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Case Unit Of Constr LPAR WILD With
##
## Ends in an error in state: 291.
##
## nsepseq(core_pattern,COMMA) -> core_pattern . [ RPAR ]
## nsepseq(core_pattern,COMMA) -> core_pattern . COMMA nsepseq(core_pattern,COMMA) [ RPAR ]
##
## The known suffix of the stack is as follows:
## core_pattern
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Case Unit Of Constr LPAR With
##
## Ends in an error in state: 275.
##
## par(nsepseq(core_pattern,COMMA)) -> LPAR . nsepseq(core_pattern,COMMA) RPAR [ SEMI RPAR RBRACKET End CONS COMMA ARROW ]
##
## The known suffix of the stack is as follows:
## LPAR
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Case Unit Of Constr With
##
## Ends in an error in state: 274.
##
## constr_pattern -> Constr . tuple_pattern [ SEMI RPAR RBRACKET End CONS COMMA ARROW ]
## constr_pattern -> Constr . [ SEMI RPAR RBRACKET End CONS COMMA ARROW ]
##
## The known suffix of the stack is as follows:
## Constr
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Case Unit Of LBRACKET VBAR Block
##
## Ends in an error in state: 262.
##
## case(expr) -> Case expr Of LBRACKET option(VBAR) . cases(expr) RBRACKET [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Of Function From End Else EOF Const COMMA Block Begin Attributes ARROW ]
##
## The known suffix of the stack is as follows:
## Case expr Of LBRACKET option(VBAR)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Case Unit Of LBRACKET WILD ARROW Bytes End
##
## Ends in an error in state: 326.
##
## case(expr) -> Case expr Of LBRACKET option(VBAR) cases(expr) . RBRACKET [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Of Function From End Else EOF Const COMMA Block Begin Attributes ARROW ]
##
## The known suffix of the stack is as follows:
## Case expr Of LBRACKET option(VBAR) cases(expr)
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
## In state 324, spurious reduction of production case_clause(expr) -> pattern ARROW expr 
## In state 328, spurious reduction of production nsepseq(case_clause(expr),VBAR) -> case_clause(expr) 
## In state 325, spurious reduction of production cases(expr) -> nsepseq(case_clause(expr),VBAR) 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Case Unit Of LBRACKET With
##
## Ends in an error in state: 261.
##
## case(expr) -> Case expr Of LBRACKET . option(VBAR) cases(expr) RBRACKET [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Of Function From End Else EOF Const COMMA Block Begin Attributes ARROW ]
##
## The known suffix of the stack is as follows:
## Case expr Of LBRACKET
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Case Unit Of LPAR WILD COMMA With
##
## Ends in an error in state: 292.
##
## nsepseq(core_pattern,COMMA) -> core_pattern COMMA . nsepseq(core_pattern,COMMA) [ RPAR ]
##
## The known suffix of the stack is as follows:
## core_pattern COMMA
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Case Unit Of LPAR WILD CONS Bytes ARROW
##
## Ends in an error in state: 304.
##
## par(cons_pattern) -> LPAR cons_pattern . RPAR [ SEMI RPAR RBRACKET End CONS COMMA ARROW ]
##
## The known suffix of the stack is as follows:
## LPAR cons_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).
## In state 298, spurious reduction of production pattern -> core_pattern 
## In state 297, spurious reduction of production cons_pattern -> core_pattern CONS pattern 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Case Unit Of LPAR WILD CONS With
##
## Ends in an error in state: 296.
##
## cons_pattern -> core_pattern CONS . pattern [ RPAR ]
##
## The known suffix of the stack is as follows:
## core_pattern CONS
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Case Unit Of LPAR WILD With
##
## Ends in an error in state: 295.
##
## cons_pattern -> core_pattern . CONS pattern [ RPAR ]
## nsepseq(core_pattern,COMMA) -> core_pattern . [ RPAR ]
## nsepseq(core_pattern,COMMA) -> core_pattern . COMMA nsepseq(core_pattern,COMMA) [ RPAR ]
##
## The known suffix of the stack is as follows:
## core_pattern
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Case Unit Of LPAR With
##
## Ends in an error in state: 270.
##
## par(cons_pattern) -> LPAR . cons_pattern RPAR [ SEMI RPAR RBRACKET End CONS COMMA ARROW ]
## par(nsepseq(core_pattern,COMMA)) -> LPAR . nsepseq(core_pattern,COMMA) RPAR [ SEMI RPAR RBRACKET End CONS COMMA ARROW ]
##
## The known suffix of the stack is as follows:
## LPAR
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Case Unit Of List LBRACKET WILD End
##
## Ends in an error in state: 308.
##
## injection(List,core_pattern) -> List LBRACKET sep_or_term_list(core_pattern,SEMI) . RBRACKET [ SEMI RPAR RBRACKET End CONS COMMA ARROW ]
##
## The known suffix of the stack is as follows:
## List LBRACKET sep_or_term_list(core_pattern,SEMI)
##
## 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).
## In state 312, spurious reduction of production nsepseq(core_pattern,SEMI) -> core_pattern 
## In state 311, spurious reduction of production sep_or_term_list(core_pattern,SEMI) -> nsepseq(core_pattern,SEMI) 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Case Unit Of List LBRACKET With
##
## Ends in an error in state: 306.
##
## injection(List,core_pattern) -> List LBRACKET . sep_or_term_list(core_pattern,SEMI) RBRACKET [ SEMI RPAR RBRACKET End CONS COMMA ARROW ]
## injection(List,core_pattern) -> List LBRACKET . RBRACKET [ SEMI RPAR RBRACKET End CONS COMMA ARROW ]
##
## The known suffix of the stack is as follows:
## List LBRACKET
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Case Unit Of List WILD RBRACKET
##
## Ends in an error in state: 320.
##
## injection(List,core_pattern) -> List sep_or_term_list(core_pattern,SEMI) . End [ SEMI RPAR RBRACKET End CONS COMMA ARROW ]
##
## The known suffix of the stack is as follows:
## List sep_or_term_list(core_pattern,SEMI)
##
## 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).
## In state 312, spurious reduction of production nsepseq(core_pattern,SEMI) -> core_pattern 
## In state 311, spurious reduction of production sep_or_term_list(core_pattern,SEMI) -> nsepseq(core_pattern,SEMI) 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Case Unit Of List WILD SEMI WILD SEMI With
##
## Ends in an error in state: 317.
##
## nsepseq(core_pattern,SEMI) -> core_pattern SEMI . nsepseq(core_pattern,SEMI) [ RBRACKET End ]
## seq(__anonymous_0(core_pattern,SEMI)) -> core_pattern SEMI . seq(__anonymous_0(core_pattern,SEMI)) [ RBRACKET End ]
##
## The known suffix of the stack is as follows:
## core_pattern SEMI
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Case Unit Of List WILD SEMI WILD With
##
## Ends in an error in state: 316.
##
## nsepseq(core_pattern,SEMI) -> core_pattern . [ RBRACKET End ]
## nsepseq(core_pattern,SEMI) -> core_pattern . SEMI nsepseq(core_pattern,SEMI) [ RBRACKET End ]
## seq(__anonymous_0(core_pattern,SEMI)) -> core_pattern . SEMI seq(__anonymous_0(core_pattern,SEMI)) [ RBRACKET End ]
##
## The known suffix of the stack is as follows:
## core_pattern
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Case Unit Of List WILD SEMI With
##
## Ends in an error in state: 313.
##
## nsepseq(core_pattern,SEMI) -> core_pattern SEMI . nsepseq(core_pattern,SEMI) [ RBRACKET End ]
## nseq(__anonymous_0(core_pattern,SEMI)) -> core_pattern SEMI . seq(__anonymous_0(core_pattern,SEMI)) [ RBRACKET End ]
##
## The known suffix of the stack is as follows:
## core_pattern SEMI
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Case Unit Of List WILD With
##
## Ends in an error in state: 312.
##
## nsepseq(core_pattern,SEMI) -> core_pattern . [ RBRACKET End ]
## nsepseq(core_pattern,SEMI) -> core_pattern . SEMI nsepseq(core_pattern,SEMI) [ RBRACKET End ]
## nseq(__anonymous_0(core_pattern,SEMI)) -> core_pattern . SEMI seq(__anonymous_0(core_pattern,SEMI)) [ RBRACKET End ]
##
## The known suffix of the stack is as follows:
## core_pattern
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Case Unit Of List With
##
## Ends in an error in state: 269.
##
## injection(List,core_pattern) -> List . sep_or_term_list(core_pattern,SEMI) End [ SEMI RPAR RBRACKET End CONS COMMA ARROW ]
## injection(List,core_pattern) -> List . End [ SEMI RPAR RBRACKET End CONS COMMA ARROW ]
## injection(List,core_pattern) -> List . LBRACKET sep_or_term_list(core_pattern,SEMI) RBRACKET [ SEMI RPAR RBRACKET End CONS COMMA ARROW ]
## injection(List,core_pattern) -> List . LBRACKET RBRACKET [ SEMI RPAR RBRACKET End CONS COMMA ARROW ]
##
## The known suffix of the stack is as follows:
## List
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Case Unit Of VBAR Block
##
## Ends in an error in state: 331.
##
## case(expr) -> Case expr Of option(VBAR) . cases(expr) End [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Of Function From End Else EOF Const COMMA Block Begin Attributes ARROW ]
##
## The known suffix of the stack is as follows:
## Case expr Of option(VBAR)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Case Unit Of WILD ARROW Bytes RBRACKET
##
## Ends in an error in state: 332.
##
## case(expr) -> Case expr Of option(VBAR) cases(expr) . End [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Of Function From End Else EOF Const COMMA Block Begin Attributes ARROW ]
##
## The known suffix of the stack is as follows:
## Case expr Of option(VBAR) cases(expr)
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
## In state 324, spurious reduction of production case_clause(expr) -> pattern ARROW expr 
## In state 328, spurious reduction of production nsepseq(case_clause(expr),VBAR) -> case_clause(expr) 
## In state 325, spurious reduction of production cases(expr) -> nsepseq(case_clause(expr),VBAR) 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Case Unit Of WILD ARROW Bytes Type
##
## Ends in an error in state: 328.
##
## nsepseq(case_clause(expr),VBAR) -> case_clause(expr) . [ RBRACKET End ]
## nsepseq(case_clause(expr),VBAR) -> case_clause(expr) . VBAR nsepseq(case_clause(expr),VBAR) [ RBRACKET End ]
##
## The known suffix of the stack is as follows:
## case_clause(expr)
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
## In state 324, spurious reduction of production case_clause(expr) -> pattern ARROW expr 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Case Unit Of WILD ARROW Bytes VBAR With
##
## Ends in an error in state: 329.
##
## nsepseq(case_clause(expr),VBAR) -> case_clause(expr) VBAR . nsepseq(case_clause(expr),VBAR) [ RBRACKET End ]
##
## The known suffix of the stack is as follows:
## case_clause(expr) VBAR
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Case Unit Of WILD ARROW With
##
## Ends in an error in state: 323.
##
## case_clause(expr) -> pattern ARROW . expr [ VBAR RBRACKET End ]
##
## The known suffix of the stack is as follows:
## pattern ARROW
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Case Unit Of WILD CONS WILD CONS With
##
## Ends in an error in state: 302.
##
## nsepseq(core_pattern,CONS) -> core_pattern CONS . nsepseq(core_pattern,CONS) [ RPAR ARROW ]
##
## The known suffix of the stack is as follows:
## core_pattern CONS
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Case Unit Of WILD CONS WILD With
##
## Ends in an error in state: 301.
##
## nsepseq(core_pattern,CONS) -> core_pattern . [ RPAR ARROW ]
## nsepseq(core_pattern,CONS) -> core_pattern . CONS nsepseq(core_pattern,CONS) [ RPAR ARROW ]
##
## The known suffix of the stack is as follows:
## core_pattern
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Case Unit Of WILD CONS With
##
## Ends in an error in state: 299.
##
## pattern -> core_pattern CONS . nsepseq(core_pattern,CONS) [ RPAR ARROW ]
##
## The known suffix of the stack is as follows:
## core_pattern CONS
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Case Unit Of WILD RPAR
##
## Ends in an error in state: 322.
##
## case_clause(expr) -> pattern . ARROW expr [ VBAR RBRACKET End ]
##
## The known suffix of the stack is as follows:
## 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).
## In state 298, spurious reduction of production pattern -> core_pattern 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Case Unit Of WILD With
##
## Ends in an error in state: 298.
##
## pattern -> core_pattern . [ RPAR ARROW ]
## pattern -> core_pattern . CONS nsepseq(core_pattern,CONS) [ RPAR ARROW ]
##
## The known suffix of the stack is as follows:
## core_pattern
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Case Unit Of With
##
## Ends in an error in state: 260.
##
## case(expr) -> Case expr Of . option(VBAR) cases(expr) End [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Of Function From End Else EOF Const COMMA Block Begin Attributes ARROW ]
## case(expr) -> Case expr Of . LBRACKET option(VBAR) cases(expr) RBRACKET [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Of Function From End Else EOF Const COMMA Block Begin Attributes ARROW ]
##
## The known suffix of the stack is as follows:
## Case expr Of
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Case Unit VBAR
##
## Ends in an error in state: 259.
##
## case(expr) -> Case expr . Of option(VBAR) cases(expr) End [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Of Function From End Else EOF Const COMMA Block Begin Attributes ARROW ]
## case(expr) -> Case expr . Of LBRACKET option(VBAR) cases(expr) RBRACKET [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Of Function From End Else EOF Const COMMA Block Begin Attributes ARROW ]
##
## The known suffix of the stack is as follows:
## Case expr
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Case With
##
## Ends in an error in state: 138.
##
## case(expr) -> Case . expr Of option(VBAR) cases(expr) End [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Of Function From End Else EOF Const COMMA Block Begin Attributes ARROW ]
## case(expr) -> Case . expr Of LBRACKET option(VBAR) cases(expr) RBRACKET [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Of Function From End Else EOF Const COMMA Block Begin Attributes ARROW ]
##
## The known suffix of the stack is as follows:
## Case
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Constr DOT And With
##
## Ends in an error in state: 176.
##
## core_expr -> module_field . [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
## fun_call -> module_field . arguments [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## module_field
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Constr DOT Ident DOT With
##
## Ends in an error in state: 127.
##
## projection -> Constr DOT Ident DOT . nsepseq(selection,DOT) [ With VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LPAR LE LBRACKET GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ASS ARROW ]
##
## The known suffix of the stack is as follows:
## Constr DOT Ident DOT
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Constr DOT Ident With
##
## Ends in an error in state: 126.
##
## module_fun -> Ident . [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LPAR LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
## projection -> Constr DOT Ident . DOT nsepseq(selection,DOT) [ With VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LPAR LE LBRACKET GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ASS ARROW ]
##
## The known suffix of the stack is as follows:
## Constr DOT Ident
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Constr DOT With
##
## Ends in an error in state: 122.
##
## module_field -> Constr DOT . module_fun [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LPAR LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
## projection -> Constr DOT . Ident DOT nsepseq(selection,DOT) [ With VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LPAR LE LBRACKET GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ASS ARROW ]
##
## The known suffix of the stack is as follows:
## Constr DOT
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Constr With
##
## Ends in an error in state: 121.
##
## core_expr -> Constr . arguments [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
## core_expr -> Constr . [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
## module_field -> Constr . DOT module_fun [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LPAR LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
## projection -> Constr . DOT Ident DOT nsepseq(selection,DOT) [ With VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LPAR LE LBRACKET GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## Constr
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Function LPAR Const Ident COLON Ident RPAR COLON Ident Is With
##
## Ends in an error in state: 119.
##
## fun_expr -> Function parameters COLON type_expr Is . expr [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Of Function From End Else EOF Const COMMA Block Begin Attributes ARROW ]
##
## The known suffix of the stack is as follows:
## Function parameters COLON type_expr Is
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Function LPAR Const Ident COLON Ident RPAR COLON Ident VBAR
##
## Ends in an error in state: 118.
##
## fun_expr -> Function parameters COLON type_expr . Is expr [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Of Function From End Else EOF Const COMMA Block Begin Attributes ARROW ]
##
## The known suffix of the stack is as follows:
## Function parameters COLON type_expr
##
## 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).
## In state 15, spurious reduction of production core_type -> Ident 
## In state 29, spurious reduction of production cartesian -> core_type 
## In state 35, spurious reduction of production fun_type -> cartesian 
## In state 43, spurious reduction of production type_expr -> fun_type 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Function LPAR Const Ident COLON Ident RPAR COLON With
##
## Ends in an error in state: 117.
##
## fun_expr -> Function parameters COLON . type_expr Is expr [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Of Function From End Else EOF Const COMMA Block Begin Attributes ARROW ]
##
## The known suffix of the stack is as follows:
## Function parameters COLON
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Function LPAR Const Ident COLON Ident RPAR With
##
## Ends in an error in state: 116.
##
## fun_expr -> Function parameters . COLON type_expr Is expr [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Of Function From End Else EOF Const COMMA Block Begin Attributes ARROW ]
##
## The known suffix of the stack is as follows:
## Function parameters
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Function LPAR Const Ident COLON With
##
## Ends in an error in state: 78.
##
## param_decl -> Const Ident COLON . param_type [ SEMI RPAR ]
##
## The known suffix of the stack is as follows:
## Const Ident COLON
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Function LPAR Const Ident With
##
## Ends in an error in state: 77.
##
## param_decl -> Const Ident . COLON param_type [ SEMI RPAR ]
##
## The known suffix of the stack is as follows:
## Const Ident
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Function LPAR Const With
##
## Ends in an error in state: 76.
##
## param_decl -> Const . Ident COLON param_type [ SEMI RPAR ]
##
## The known suffix of the stack is as follows:
## Const
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Function LPAR Var Ident COLON Ident SEMI With
##
## Ends in an error in state: 81.
##
## nsepseq(param_decl,SEMI) -> param_decl SEMI . nsepseq(param_decl,SEMI) [ RPAR ]
##
## The known suffix of the stack is as follows:
## param_decl SEMI
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Function LPAR Var Ident COLON Ident VBAR
##
## Ends in an error in state: 80.
##
## nsepseq(param_decl,SEMI) -> param_decl . [ RPAR ]
## nsepseq(param_decl,SEMI) -> param_decl . SEMI nsepseq(param_decl,SEMI) [ RPAR ]
##
## The known suffix of the stack is as follows:
## param_decl
##
## 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).
## In state 15, spurious reduction of production core_type -> Ident 
## In state 29, spurious reduction of production cartesian -> core_type 
## In state 35, spurious reduction of production fun_type -> cartesian 
## In state 75, spurious reduction of production param_type -> fun_type 
## In state 74, spurious reduction of production param_decl -> Var Ident COLON param_type 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Function LPAR Var Ident COLON With
##
## Ends in an error in state: 73.
##
## param_decl -> Var Ident COLON . param_type [ SEMI RPAR ]
##
## The known suffix of the stack is as follows:
## Var Ident COLON
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Function LPAR Var Ident With
##
## Ends in an error in state: 72.
##
## param_decl -> Var Ident . COLON param_type [ SEMI RPAR ]
##
## The known suffix of the stack is as follows:
## Var Ident
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Function LPAR Var With
##
## Ends in an error in state: 71.
##
## param_decl -> Var . Ident COLON param_type [ SEMI RPAR ]
##
## The known suffix of the stack is as follows:
## Var
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Function LPAR With
##
## Ends in an error in state: 70.
##
## par(nsepseq(param_decl,SEMI)) -> LPAR . nsepseq(param_decl,SEMI) RPAR [ COLON ]
##
## The known suffix of the stack is as follows:
## LPAR
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Function With
##
## Ends in an error in state: 115.
##
## fun_expr -> Function . parameters COLON type_expr Is expr [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Of Function From End Else EOF Const COMMA Block Begin Attributes ARROW ]
##
## The known suffix of the stack is as follows:
## Function
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Ident DOT Ident ASS
##
## Ends in an error in state: 154.
##
## fun_call_or_par_or_projection -> projection . option(arguments) [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
## path -> projection . [ With LBRACKET ]
##
## The known suffix of the stack is as follows:
## projection
##
## 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).
## In state 130, spurious reduction of production nsepseq(selection,DOT) -> selection 
## In state 342, spurious reduction of production projection -> Ident DOT nsepseq(selection,DOT) 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Ident DOT Int DOT With
##
## Ends in an error in state: 131.
##
## nsepseq(selection,DOT) -> selection DOT . nsepseq(selection,DOT) [ With VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LPAR LE LBRACKET GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ASS ARROW ]
##
## The known suffix of the stack is as follows:
## selection DOT
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Ident DOT Int While
##
## Ends in an error in state: 130.
##
## nsepseq(selection,DOT) -> selection . [ With VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LPAR LE LBRACKET GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ASS ARROW ]
## nsepseq(selection,DOT) -> selection . DOT nsepseq(selection,DOT) [ With VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LPAR LE LBRACKET GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ASS ARROW ]
##
## The known suffix of the stack is as follows:
## selection
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Ident DOT With
##
## Ends in an error in state: 341.
##
## projection -> Ident DOT . nsepseq(selection,DOT) [ With VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LPAR LE LBRACKET GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ASS ARROW ]
##
## The known suffix of the stack is as follows:
## Ident DOT
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Ident LBRACKET Unit VBAR
##
## Ends in an error in state: 241.
##
## brackets(expr) -> LBRACKET expr . RBRACKET [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ASS ARROW ]
##
## The known suffix of the stack is as follows:
## LBRACKET expr
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Ident LBRACKET With
##
## Ends in an error in state: 240.
##
## brackets(expr) -> LBRACKET . expr RBRACKET [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ASS ARROW ]
##
## The known suffix of the stack is as follows:
## LBRACKET
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Ident LPAR Unit COMMA With
##
## Ends in an error in state: 339.
##
## nsepseq(expr,COMMA) -> expr COMMA . nsepseq(expr,COMMA) [ RPAR ]
##
## The known suffix of the stack is as follows:
## expr COMMA
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Ident LPAR Unit VBAR
##
## Ends in an error in state: 338.
##
## nsepseq(expr,COMMA) -> expr . [ RPAR ]
## nsepseq(expr,COMMA) -> expr . COMMA nsepseq(expr,COMMA) [ RPAR ]
##
## The known suffix of the stack is as follows:
## expr
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Ident LPAR With
##
## Ends in an error in state: 114.
##
## par(nsepseq(expr,COMMA)) -> LPAR . nsepseq(expr,COMMA) RPAR [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## LPAR
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Ident While
##
## Ends in an error in state: 113.
##
## core_expr -> Ident . [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
## fun_call -> Ident . arguments [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
## path -> Ident . [ With LBRACKET ]
## projection -> Ident . DOT nsepseq(selection,DOT) [ With VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LPAR LE LBRACKET GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## Ident
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Ident With Record Ident DOT With
##
## Ends in an error in state: 162.
##
## nsepseq(field_name,DOT) -> Ident DOT . nsepseq(field_name,DOT) [ EQ ]
##
## The known suffix of the stack is as follows:
## Ident DOT
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Ident With Record Ident EQ Bytes RBRACKET
##
## Ends in an error in state: 237.
##
## ne_injection(Record,field_path_assignment) -> Record sep_or_term_list(field_path_assignment,SEMI) . End [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## Record sep_or_term_list(field_path_assignment,SEMI)
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
## In state 194, spurious reduction of production field_path_assignment -> nsepseq(field_name,DOT) EQ expr 
## In state 230, spurious reduction of production nsepseq(field_path_assignment,SEMI) -> field_path_assignment 
## In state 167, spurious reduction of production sep_or_term_list(field_path_assignment,SEMI) -> nsepseq(field_path_assignment,SEMI) 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Ident With Record Ident EQ Bytes SEMI Ident EQ Bytes SEMI With
##
## Ends in an error in state: 235.
##
## nsepseq(field_path_assignment,SEMI) -> field_path_assignment SEMI . nsepseq(field_path_assignment,SEMI) [ RBRACKET End ]
## seq(__anonymous_0(field_path_assignment,SEMI)) -> field_path_assignment SEMI . seq(__anonymous_0(field_path_assignment,SEMI)) [ RBRACKET End ]
##
## The known suffix of the stack is as follows:
## field_path_assignment SEMI
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Ident With Record Ident EQ Bytes SEMI Ident EQ Bytes VBAR
##
## Ends in an error in state: 234.
##
## nsepseq(field_path_assignment,SEMI) -> field_path_assignment . [ RBRACKET End ]
## nsepseq(field_path_assignment,SEMI) -> field_path_assignment . SEMI nsepseq(field_path_assignment,SEMI) [ RBRACKET End ]
## seq(__anonymous_0(field_path_assignment,SEMI)) -> field_path_assignment . SEMI seq(__anonymous_0(field_path_assignment,SEMI)) [ RBRACKET End ]
##
## The known suffix of the stack is as follows:
## field_path_assignment
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
## In state 194, spurious reduction of production field_path_assignment -> nsepseq(field_name,DOT) EQ expr 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Ident With Record Ident EQ Bytes SEMI With
##
## Ends in an error in state: 231.
##
## nsepseq(field_path_assignment,SEMI) -> field_path_assignment SEMI . nsepseq(field_path_assignment,SEMI) [ RBRACKET End ]
## nseq(__anonymous_0(field_path_assignment,SEMI)) -> field_path_assignment SEMI . seq(__anonymous_0(field_path_assignment,SEMI)) [ RBRACKET End ]
##
## The known suffix of the stack is as follows:
## field_path_assignment SEMI
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Ident With Record Ident EQ Bytes VBAR
##
## Ends in an error in state: 230.
##
## nsepseq(field_path_assignment,SEMI) -> field_path_assignment . [ RBRACKET End ]
## nsepseq(field_path_assignment,SEMI) -> field_path_assignment . SEMI nsepseq(field_path_assignment,SEMI) [ RBRACKET End ]
## nseq(__anonymous_0(field_path_assignment,SEMI)) -> field_path_assignment . SEMI seq(__anonymous_0(field_path_assignment,SEMI)) [ RBRACKET End ]
##
## The known suffix of the stack is as follows:
## field_path_assignment
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
## In state 194, spurious reduction of production field_path_assignment -> nsepseq(field_name,DOT) EQ expr 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Ident With Record Ident EQ With
##
## Ends in an error in state: 169.
##
## field_path_assignment -> nsepseq(field_name,DOT) EQ . expr [ SEMI RBRACKET End ]
##
## The known suffix of the stack is as follows:
## nsepseq(field_name,DOT) EQ
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Ident With Record Ident With
##
## Ends in an error in state: 161.
##
## nsepseq(field_name,DOT) -> Ident . [ EQ ]
## nsepseq(field_name,DOT) -> Ident . DOT nsepseq(field_name,DOT) [ EQ ]
##
## The known suffix of the stack is as follows:
## Ident
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Ident With Record LBRACKET Ident EQ Bytes End
##
## Ends in an error in state: 164.
##
## ne_injection(Record,field_path_assignment) -> Record LBRACKET sep_or_term_list(field_path_assignment,SEMI) . RBRACKET [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## Record LBRACKET sep_or_term_list(field_path_assignment,SEMI)
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
## In state 194, spurious reduction of production field_path_assignment -> nsepseq(field_name,DOT) EQ expr 
## In state 230, spurious reduction of production nsepseq(field_path_assignment,SEMI) -> field_path_assignment 
## In state 167, spurious reduction of production sep_or_term_list(field_path_assignment,SEMI) -> nsepseq(field_path_assignment,SEMI) 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Ident With Record LBRACKET With
##
## Ends in an error in state: 160.
##
## ne_injection(Record,field_path_assignment) -> Record LBRACKET . sep_or_term_list(field_path_assignment,SEMI) RBRACKET [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## Record LBRACKET
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Ident With Record With
##
## Ends in an error in state: 159.
##
## ne_injection(Record,field_path_assignment) -> Record . sep_or_term_list(field_path_assignment,SEMI) End [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
## ne_injection(Record,field_path_assignment) -> Record . LBRACKET sep_or_term_list(field_path_assignment,SEMI) RBRACKET [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## Record
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Ident With With
##
## Ends in an error in state: 158.
##
## update_record -> path With . ne_injection(Record,field_path_assignment) [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## path With
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If Unit Then Unit Else With
##
## Ends in an error in state: 348.
##
## cond_expr -> If expr Then expr option(SEMI) Else . expr [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Of Function From End Else EOF Const COMMA Block Begin Attributes ARROW ]
##
## The known suffix of the stack is as follows:
## If expr Then expr option(SEMI) Else
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If Unit Then Unit SEMI EQ
##
## Ends in an error in state: 347.
##
## cond_expr -> If expr Then expr option(SEMI) . Else expr [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Of Function From End Else EOF Const COMMA Block Begin Attributes ARROW ]
##
## The known suffix of the stack is as follows:
## If expr Then expr option(SEMI)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If Unit Then Unit VBAR
##
## Ends in an error in state: 346.
##
## cond_expr -> If expr Then expr . option(SEMI) Else expr [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Of Function From End Else EOF Const COMMA Block Begin Attributes ARROW ]
##
## The known suffix of the stack is as follows:
## If expr Then expr
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If Unit Then With
##
## Ends in an error in state: 345.
##
## cond_expr -> If expr Then . expr option(SEMI) Else expr [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Of Function From End Else EOF Const COMMA Block Begin Attributes ARROW ]
##
## The known suffix of the stack is as follows:
## If expr Then
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If Unit VBAR
##
## Ends in an error in state: 344.
##
## cond_expr -> If expr . Then expr option(SEMI) Else expr [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Of Function From End Else EOF Const COMMA Block Begin Attributes ARROW ]
##
## The known suffix of the stack is as follows:
## If expr
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If With
##
## Ends in an error in state: 112.
##
## cond_expr -> If . expr Then expr option(SEMI) Else expr [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Of Function From End Else EOF Const COMMA Block Begin Attributes ARROW ]
##
## The known suffix of the stack is as follows:
## If
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LPAR Bytes RPAR With
##
## Ends in an error in state: 171.
##
## fun_call_or_par_or_projection -> par(expr) . option(arguments) [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## par(expr)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LPAR If Unit Then Bytes Else Bytes VBAR
##
## Ends in an error in state: 352.
##
## par(expr) -> LPAR expr . RPAR [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LPAR LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
## tuple_comp -> expr . COMMA nsepseq(expr,COMMA) [ RPAR ]
##
## The known suffix of the stack is as follows:
## LPAR expr
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
## In state 349, spurious reduction of production cond_expr -> If expr Then expr option(SEMI) Else expr 
## In state 228, spurious reduction of production expr -> cond_expr 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LPAR Unit COLON Ident VBAR
##
## Ends in an error in state: 358.
##
## annot_expr -> LPAR disj_expr COLON type_expr . RPAR [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## LPAR disj_expr COLON type_expr
##
## 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).
## In state 15, spurious reduction of production core_type -> Ident 
## In state 29, spurious reduction of production cartesian -> core_type 
## In state 35, spurious reduction of production fun_type -> cartesian 
## In state 43, spurious reduction of production type_expr -> fun_type 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LPAR Unit COLON With
##
## Ends in an error in state: 357.
##
## annot_expr -> LPAR disj_expr COLON . type_expr RPAR [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## LPAR disj_expr COLON
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LPAR Unit COMMA With
##
## Ends in an error in state: 354.
##
## tuple_comp -> expr COMMA . nsepseq(expr,COMMA) [ RPAR ]
##
## The known suffix of the stack is as follows:
## expr COMMA
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LPAR Unit VBAR
##
## Ends in an error in state: 356.
##
## annot_expr -> LPAR disj_expr . COLON type_expr RPAR [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
## disj_expr -> disj_expr . Or conj_expr [ RPAR Or COMMA COLON ]
## expr -> disj_expr . [ RPAR COMMA ]
##
## The known suffix of the stack is as follows:
## LPAR disj_expr
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LPAR With
##
## Ends in an error in state: 110.
##
## annot_expr -> LPAR . disj_expr COLON type_expr RPAR [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
## par(expr) -> LPAR . expr RPAR [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LPAR LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
## par(tuple_comp) -> LPAR . tuple_comp RPAR [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## LPAR
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: List LBRACKET Unit End
##
## Ends in an error in state: 362.
##
## injection(List,expr) -> List LBRACKET sep_or_term_list(expr,SEMI) . RBRACKET [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## List LBRACKET sep_or_term_list(expr,SEMI)
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
## In state 366, spurious reduction of production nsepseq(expr,SEMI) -> expr 
## In state 365, spurious reduction of production sep_or_term_list(expr,SEMI) -> nsepseq(expr,SEMI) 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: List LBRACKET With
##
## Ends in an error in state: 360.
##
## injection(List,expr) -> List LBRACKET . sep_or_term_list(expr,SEMI) RBRACKET [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
## injection(List,expr) -> List LBRACKET . RBRACKET [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## List LBRACKET
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: List Unit RBRACKET
##
## Ends in an error in state: 374.
##
## injection(List,expr) -> List sep_or_term_list(expr,SEMI) . End [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## List sep_or_term_list(expr,SEMI)
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
## In state 366, spurious reduction of production nsepseq(expr,SEMI) -> expr 
## In state 365, spurious reduction of production sep_or_term_list(expr,SEMI) -> nsepseq(expr,SEMI) 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: List With
##
## Ends in an error in state: 109.
##
## injection(List,expr) -> List . sep_or_term_list(expr,SEMI) End [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
## injection(List,expr) -> List . End [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
## injection(List,expr) -> List . LBRACKET sep_or_term_list(expr,SEMI) RBRACKET [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
## injection(List,expr) -> List . LBRACKET RBRACKET [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## List
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: MINUS With
##
## Ends in an error in state: 108.
##
## unary_expr -> MINUS . core_expr [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## MINUS
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Map LBRACKET Unit ARROW Bytes End
##
## Ends in an error in state: 379.
##
## injection(Map,binding) -> Map LBRACKET sep_or_term_list(binding,SEMI) . RBRACKET [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## Map LBRACKET sep_or_term_list(binding,SEMI)
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
## In state 248, spurious reduction of production binding -> expr ARROW expr 
## In state 249, spurious reduction of production nsepseq(binding,SEMI) -> binding 
## In state 245, spurious reduction of production sep_or_term_list(binding,SEMI) -> nsepseq(binding,SEMI) 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Map LBRACKET With
##
## Ends in an error in state: 377.
##
## injection(Map,binding) -> Map LBRACKET . sep_or_term_list(binding,SEMI) RBRACKET [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
## injection(Map,binding) -> Map LBRACKET . RBRACKET [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## Map LBRACKET
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Map Unit ARROW Bytes RBRACKET
##
## Ends in an error in state: 382.
##
## injection(Map,binding) -> Map sep_or_term_list(binding,SEMI) . End [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## Map sep_or_term_list(binding,SEMI)
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
## In state 248, spurious reduction of production binding -> expr ARROW expr 
## In state 249, spurious reduction of production nsepseq(binding,SEMI) -> binding 
## In state 245, spurious reduction of production sep_or_term_list(binding,SEMI) -> nsepseq(binding,SEMI) 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Map Unit ARROW Bytes SEMI Unit ARROW Bytes SEMI With
##
## Ends in an error in state: 254.
##
## nsepseq(binding,SEMI) -> binding SEMI . nsepseq(binding,SEMI) [ RBRACKET End ]
## seq(__anonymous_0(binding,SEMI)) -> binding SEMI . seq(__anonymous_0(binding,SEMI)) [ RBRACKET End ]
##
## The known suffix of the stack is as follows:
## binding SEMI
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Map Unit ARROW Bytes SEMI Unit ARROW Bytes VBAR
##
## Ends in an error in state: 253.
##
## nsepseq(binding,SEMI) -> binding . [ RBRACKET End ]
## nsepseq(binding,SEMI) -> binding . SEMI nsepseq(binding,SEMI) [ RBRACKET End ]
## seq(__anonymous_0(binding,SEMI)) -> binding . SEMI seq(__anonymous_0(binding,SEMI)) [ RBRACKET End ]
##
## The known suffix of the stack is as follows:
## binding
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
## In state 248, spurious reduction of production binding -> expr ARROW expr 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Map Unit ARROW Bytes SEMI With
##
## Ends in an error in state: 250.
##
## nsepseq(binding,SEMI) -> binding SEMI . nsepseq(binding,SEMI) [ RBRACKET End ]
## nseq(__anonymous_0(binding,SEMI)) -> binding SEMI . seq(__anonymous_0(binding,SEMI)) [ RBRACKET End ]
##
## The known suffix of the stack is as follows:
## binding SEMI
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Map Unit ARROW Bytes VBAR
##
## Ends in an error in state: 249.
##
## nsepseq(binding,SEMI) -> binding . [ RBRACKET End ]
## nsepseq(binding,SEMI) -> binding . SEMI nsepseq(binding,SEMI) [ RBRACKET End ]
## nseq(__anonymous_0(binding,SEMI)) -> binding . SEMI seq(__anonymous_0(binding,SEMI)) [ RBRACKET End ]
##
## The known suffix of the stack is as follows:
## binding
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
## In state 248, spurious reduction of production binding -> expr ARROW expr 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Map Unit ARROW With
##
## Ends in an error in state: 247.
##
## binding -> expr ARROW . expr [ SEMI RBRACKET End ]
##
## The known suffix of the stack is as follows:
## expr ARROW
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Map Unit VBAR
##
## Ends in an error in state: 246.
##
## binding -> expr . ARROW expr [ SEMI RBRACKET End ]
##
## The known suffix of the stack is as follows:
## expr
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Map With
##
## Ends in an error in state: 107.
##
## injection(Map,binding) -> Map . sep_or_term_list(binding,SEMI) End [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
## injection(Map,binding) -> Map . End [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
## injection(Map,binding) -> Map . LBRACKET sep_or_term_list(binding,SEMI) RBRACKET [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
## injection(Map,binding) -> Map . LBRACKET RBRACKET [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## Map
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Not Bytes With
##
## Ends in an error in state: 173.
##
## add_expr -> mult_expr . [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE MINUS LT LE GT GE Function From End Else EQ EOF Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
## mult_expr -> mult_expr . TIMES unary_expr [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
## mult_expr -> mult_expr . SLASH unary_expr [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
## mult_expr -> mult_expr . Mod unary_expr [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## mult_expr
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Not With
##
## Ends in an error in state: 103.
##
## unary_expr -> Not . core_expr [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## Not
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Record Ident EQ Bytes RBRACKET
##
## Ends in an error in state: 397.
##
## record_expr -> Record sep_or_term_list(field_assignment,SEMI) . End [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## Record sep_or_term_list(field_assignment,SEMI)
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
## In state 385, spurious reduction of production field_assignment -> Ident EQ expr 
## In state 390, spurious reduction of production nsepseq(field_assignment,SEMI) -> field_assignment 
## In state 389, spurious reduction of production sep_or_term_list(field_assignment,SEMI) -> nsepseq(field_assignment,SEMI) 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Record Ident EQ Bytes SEMI Ident EQ Bytes SEMI With
##
## Ends in an error in state: 395.
##
## nsepseq(field_assignment,SEMI) -> field_assignment SEMI . nsepseq(field_assignment,SEMI) [ RBRACKET End ]
## seq(__anonymous_0(field_assignment,SEMI)) -> field_assignment SEMI . seq(__anonymous_0(field_assignment,SEMI)) [ RBRACKET End ]
##
## The known suffix of the stack is as follows:
## field_assignment SEMI
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Record Ident EQ Bytes SEMI Ident EQ Bytes VBAR
##
## Ends in an error in state: 394.
##
## nsepseq(field_assignment,SEMI) -> field_assignment . [ RBRACKET End ]
## nsepseq(field_assignment,SEMI) -> field_assignment . SEMI nsepseq(field_assignment,SEMI) [ RBRACKET End ]
## seq(__anonymous_0(field_assignment,SEMI)) -> field_assignment . SEMI seq(__anonymous_0(field_assignment,SEMI)) [ RBRACKET End ]
##
## The known suffix of the stack is as follows:
## field_assignment
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
## In state 385, spurious reduction of production field_assignment -> Ident EQ expr 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Record Ident EQ Bytes SEMI With
##
## Ends in an error in state: 391.
##
## nsepseq(field_assignment,SEMI) -> field_assignment SEMI . nsepseq(field_assignment,SEMI) [ RBRACKET End ]
## nseq(__anonymous_0(field_assignment,SEMI)) -> field_assignment SEMI . seq(__anonymous_0(field_assignment,SEMI)) [ RBRACKET End ]
##
## The known suffix of the stack is as follows:
## field_assignment SEMI
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Record Ident EQ Bytes VBAR
##
## Ends in an error in state: 390.
##
## nsepseq(field_assignment,SEMI) -> field_assignment . [ RBRACKET End ]
## nsepseq(field_assignment,SEMI) -> field_assignment . SEMI nsepseq(field_assignment,SEMI) [ RBRACKET End ]
## nseq(__anonymous_0(field_assignment,SEMI)) -> field_assignment . SEMI seq(__anonymous_0(field_assignment,SEMI)) [ RBRACKET End ]
##
## The known suffix of the stack is as follows:
## field_assignment
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
## In state 385, spurious reduction of production field_assignment -> Ident EQ expr 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Record Ident EQ With
##
## Ends in an error in state: 102.
##
## field_assignment -> Ident EQ . expr [ SEMI RBRACKET End ]
##
## The known suffix of the stack is as follows:
## Ident EQ
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Record Ident With
##
## Ends in an error in state: 101.
##
## field_assignment -> Ident . EQ expr [ SEMI RBRACKET End ]
##
## The known suffix of the stack is as follows:
## Ident
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Record LBRACKET Ident EQ Bytes End
##
## Ends in an error in state: 386.
##
## record_expr -> Record LBRACKET sep_or_term_list(field_assignment,SEMI) . RBRACKET [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## Record LBRACKET sep_or_term_list(field_assignment,SEMI)
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
## In state 385, spurious reduction of production field_assignment -> Ident EQ expr 
## In state 390, spurious reduction of production nsepseq(field_assignment,SEMI) -> field_assignment 
## In state 389, spurious reduction of production sep_or_term_list(field_assignment,SEMI) -> nsepseq(field_assignment,SEMI) 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Record LBRACKET With
##
## Ends in an error in state: 100.
##
## record_expr -> Record LBRACKET . sep_or_term_list(field_assignment,SEMI) RBRACKET [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## Record LBRACKET
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Record With
##
## Ends in an error in state: 99.
##
## record_expr -> Record . sep_or_term_list(field_assignment,SEMI) End [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
## record_expr -> Record . LBRACKET sep_or_term_list(field_assignment,SEMI) RBRACKET [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## Record
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Recursive Function LPAR Const Ident COLON Ident RPAR COLON Ident Is With
##
## Ends in an error in state: 98.
##
## fun_expr -> Recursive Function parameters COLON type_expr Is . expr [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Of Function From End Else EOF Const COMMA Block Begin Attributes ARROW ]
##
## The known suffix of the stack is as follows:
## Recursive Function parameters COLON type_expr Is
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Recursive Function LPAR Const Ident COLON Ident RPAR COLON Ident VBAR
##
## Ends in an error in state: 97.
##
## fun_expr -> Recursive Function parameters COLON type_expr . Is expr [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Of Function From End Else EOF Const COMMA Block Begin Attributes ARROW ]
##
## The known suffix of the stack is as follows:
## Recursive Function parameters COLON type_expr
##
## 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).
## In state 15, spurious reduction of production core_type -> Ident 
## In state 29, spurious reduction of production cartesian -> core_type 
## In state 35, spurious reduction of production fun_type -> cartesian 
## In state 43, spurious reduction of production type_expr -> fun_type 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Recursive Function LPAR Const Ident COLON Ident RPAR COLON With
##
## Ends in an error in state: 96.
##
## fun_expr -> Recursive Function parameters COLON . type_expr Is expr [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Of Function From End Else EOF Const COMMA Block Begin Attributes ARROW ]
##
## The known suffix of the stack is as follows:
## Recursive Function parameters COLON
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Recursive Function LPAR Const Ident COLON Ident RPAR With
##
## Ends in an error in state: 95.
##
## fun_expr -> Recursive Function parameters . COLON type_expr Is expr [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Of Function From End Else EOF Const COMMA Block Begin Attributes ARROW ]
##
## The known suffix of the stack is as follows:
## Recursive Function parameters
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Recursive Function With
##
## Ends in an error in state: 94.
##
## fun_expr -> Recursive Function . parameters COLON type_expr Is expr [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Of Function From End Else EOF Const COMMA Block Begin Attributes ARROW ]
##
## The known suffix of the stack is as follows:
## Recursive Function
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Recursive With
##
## Ends in an error in state: 93.
##
## fun_expr -> Recursive . Function parameters COLON type_expr Is expr [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Of Function From End Else EOF Const COMMA Block Begin Attributes ARROW ]
##
## The known suffix of the stack is as follows:
## Recursive
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Set LBRACKET Unit End
##
## Ends in an error in state: 402.
##
## injection(Set,expr) -> Set LBRACKET sep_or_term_list(expr,SEMI) . RBRACKET [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## Set LBRACKET sep_or_term_list(expr,SEMI)
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
## In state 366, spurious reduction of production nsepseq(expr,SEMI) -> expr 
## In state 365, spurious reduction of production sep_or_term_list(expr,SEMI) -> nsepseq(expr,SEMI) 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Set LBRACKET With
##
## Ends in an error in state: 400.
##
## injection(Set,expr) -> Set LBRACKET . sep_or_term_list(expr,SEMI) RBRACKET [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
## injection(Set,expr) -> Set LBRACKET . RBRACKET [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## Set LBRACKET
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Set Unit RBRACKET
##
## Ends in an error in state: 405.
##
## injection(Set,expr) -> Set sep_or_term_list(expr,SEMI) . End [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## Set sep_or_term_list(expr,SEMI)
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
## In state 366, spurious reduction of production nsepseq(expr,SEMI) -> expr 
## In state 365, spurious reduction of production sep_or_term_list(expr,SEMI) -> nsepseq(expr,SEMI) 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Set Unit SEMI Unit SEMI With
##
## Ends in an error in state: 371.
##
## nsepseq(expr,SEMI) -> expr SEMI . nsepseq(expr,SEMI) [ RBRACKET End ]
## seq(__anonymous_0(expr,SEMI)) -> expr SEMI . seq(__anonymous_0(expr,SEMI)) [ RBRACKET End ]
##
## The known suffix of the stack is as follows:
## expr SEMI
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Set Unit SEMI Unit VBAR
##
## Ends in an error in state: 370.
##
## nsepseq(expr,SEMI) -> expr . [ RBRACKET End ]
## nsepseq(expr,SEMI) -> expr . SEMI nsepseq(expr,SEMI) [ RBRACKET End ]
## seq(__anonymous_0(expr,SEMI)) -> expr . SEMI seq(__anonymous_0(expr,SEMI)) [ RBRACKET End ]
##
## The known suffix of the stack is as follows:
## expr
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Set Unit SEMI With
##
## Ends in an error in state: 367.
##
## nsepseq(expr,SEMI) -> expr SEMI . nsepseq(expr,SEMI) [ RBRACKET End ]
## nseq(__anonymous_0(expr,SEMI)) -> expr SEMI . seq(__anonymous_0(expr,SEMI)) [ RBRACKET End ]
##
## The known suffix of the stack is as follows:
## expr SEMI
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Set Unit VBAR
##
## Ends in an error in state: 366.
##
## nsepseq(expr,SEMI) -> expr . [ RBRACKET End ]
## nsepseq(expr,SEMI) -> expr . SEMI nsepseq(expr,SEMI) [ RBRACKET End ]
## nseq(__anonymous_0(expr,SEMI)) -> expr . SEMI seq(__anonymous_0(expr,SEMI)) [ RBRACKET End ]
##
## The known suffix of the stack is as follows:
## expr
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Set With
##
## Ends in an error in state: 92.
##
## injection(Set,expr) -> Set . sep_or_term_list(expr,SEMI) End [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
## injection(Set,expr) -> Set . End [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
## injection(Set,expr) -> Set . LBRACKET sep_or_term_list(expr,SEMI) RBRACKET [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
## injection(Set,expr) -> Set . LBRACKET RBRACKET [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Contains Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## Set
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Unit And With
##
## Ends in an error in state: 225.
##
## conj_expr -> conj_expr And . set_membership [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Or Of Function From End Else EOF Const COMMA COLON Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## conj_expr And
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Unit CAT With
##
## Ends in an error in state: 201.
##
## cat_expr -> cons_expr CAT . cat_expr [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Or Of NE LT LE GT GE Function From End Else EQ EOF Const COMMA COLON Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## cons_expr CAT
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Unit COLON
##
## Ends in an error in state: 195.
##
## disj_expr -> disj_expr . Or conj_expr [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Or Of Function From End Else EOF Const COMMA Block Begin Attributes ARROW ]
## expr -> disj_expr . [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Of Function From End Else EOF Const COMMA Block Begin Attributes ARROW ]
##
## The known suffix of the stack is as follows:
## disj_expr
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Unit CONS With
##
## Ends in an error in state: 208.
##
## cons_expr -> add_expr CONS . cons_expr [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Or Of NE LT LE GT GE Function From End Else EQ EOF Const COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## add_expr CONS
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Unit Contains With
##
## Ends in an error in state: 198.
##
## set_membership -> core_expr Contains . set_membership [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Or Of Function From End Else EOF Const COMMA COLON Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## core_expr Contains
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Unit EQ With
##
## Ends in an error in state: 221.
##
## comp_expr -> comp_expr EQ . cat_expr [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Or Of NE LT LE GT GE Function From End Else EQ EOF Const COMMA COLON Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## comp_expr EQ
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Unit GE With
##
## Ends in an error in state: 219.
##
## comp_expr -> comp_expr GE . cat_expr [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Or Of NE LT LE GT GE Function From End Else EQ EOF Const COMMA COLON Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## comp_expr GE
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Unit GT With
##
## Ends in an error in state: 217.
##
## comp_expr -> comp_expr GT . cat_expr [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Or Of NE LT LE GT GE Function From End Else EQ EOF Const COMMA COLON Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## comp_expr GT
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Unit LE With
##
## Ends in an error in state: 215.
##
## comp_expr -> comp_expr LE . cat_expr [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Or Of NE LT LE GT GE Function From End Else EQ EOF Const COMMA COLON Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## comp_expr LE
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Unit LT With
##
## Ends in an error in state: 213.
##
## comp_expr -> comp_expr LT . cat_expr [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Or Of NE LT LE GT GE Function From End Else EQ EOF Const COMMA COLON Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## comp_expr LT
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Unit MINUS Unit With
##
## Ends in an error in state: 207.
##
## add_expr -> add_expr MINUS mult_expr . [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE MINUS LT LE GT GE Function From End Else EQ EOF Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
## mult_expr -> mult_expr . TIMES unary_expr [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
## mult_expr -> mult_expr . SLASH unary_expr [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
## mult_expr -> mult_expr . Mod unary_expr [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## add_expr MINUS mult_expr
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Unit MINUS With
##
## Ends in an error in state: 206.
##
## add_expr -> add_expr MINUS . mult_expr [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE MINUS LT LE GT GE Function From End Else EQ EOF Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## add_expr MINUS
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Unit Mod With
##
## Ends in an error in state: 191.
##
## mult_expr -> mult_expr Mod . unary_expr [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## mult_expr Mod
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Unit NE With
##
## Ends in an error in state: 211.
##
## comp_expr -> comp_expr NE . cat_expr [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Or Of NE LT LE GT GE Function From End Else EQ EOF Const COMMA COLON Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## comp_expr NE
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Unit Or With
##
## Ends in an error in state: 196.
##
## disj_expr -> disj_expr Or . conj_expr [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Or Of Function From End Else EOF Const COMMA COLON Block Begin Attributes ARROW ]
##
## The known suffix of the stack is as follows:
## disj_expr Or
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Unit PLUS Unit With
##
## Ends in an error in state: 205.
##
## add_expr -> add_expr PLUS mult_expr . [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE MINUS LT LE GT GE Function From End Else EQ EOF Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
## mult_expr -> mult_expr . TIMES unary_expr [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
## mult_expr -> mult_expr . SLASH unary_expr [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
## mult_expr -> mult_expr . Mod unary_expr [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## add_expr PLUS mult_expr
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Unit PLUS With
##
## Ends in an error in state: 204.
##
## add_expr -> add_expr PLUS . mult_expr [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE MINUS LT LE GT GE Function From End Else EQ EOF Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## add_expr PLUS
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Unit SLASH With
##
## Ends in an error in state: 189.
##
## mult_expr -> mult_expr SLASH . unary_expr [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## mult_expr SLASH
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Unit TIMES With
##
## Ends in an error in state: 174.
##
## mult_expr -> mult_expr TIMES . unary_expr [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## mult_expr TIMES
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Unit VBAR
##
## Ends in an error in state: 607.
##
## interactive_expr -> expr . EOF [ # ]
##
## The known suffix of the stack is as follows:
## expr
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Unit With
##
## Ends in an error in state: 197.
##
## set_membership -> core_expr . Contains set_membership [ VBAR Type To Then Step SEMI Recursive RPAR RBRACKET RBRACE Or Of Function From End Else EOF Const COMMA COLON Block Begin Attributes And ARROW ]
## unary_expr -> core_expr . [ VBAR Type To Then TIMES Step SLASH SEMI Recursive RPAR RBRACKET RBRACE PLUS Or Of NE Mod MINUS LT LE GT GE Function From End Else EQ EOF Const CONS COMMA COLON CAT Block Begin Attributes And ARROW ]
##
## The known suffix of the stack is as follows:
## core_expr
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: With
##
## Ends in an error in state: 605.
##
## interactive_expr' -> . interactive_expr [ # ]
##
## The known suffix of the stack is as follows:
##
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Attributes LBRACKET String End
##
## Ends in an error in state: 551.
##
## ne_injection(Attributes,String) -> Attributes LBRACKET sep_or_term_list(String,SEMI) . RBRACKET [ Type SEMI Recursive RBRACE Function End EOF Const Attributes ]
##
## The known suffix of the stack is as follows:
## Attributes LBRACKET sep_or_term_list(String,SEMI)
##
## 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).
## In state 543, spurious reduction of production nsepseq(String,SEMI) -> String 
## In state 554, spurious reduction of production sep_or_term_list(String,SEMI) -> nsepseq(String,SEMI) 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Attributes LBRACKET With
##
## Ends in an error in state: 550.
##
## ne_injection(Attributes,String) -> Attributes LBRACKET . sep_or_term_list(String,SEMI) RBRACKET [ Type SEMI Recursive RBRACE Function End EOF Const Attributes ]
##
## The known suffix of the stack is as follows:
## Attributes LBRACKET
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Attributes String End Attributes String End SEMI With
##
## Ends in an error in state: 600.
##
## seq(declaration) -> declaration . seq(declaration) [ EOF ]
##
## The known suffix of the stack is as follows:
## declaration
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Attributes String End SEMI With
##
## Ends in an error in state: 598.
##
## nseq(declaration) -> declaration . seq(declaration) [ EOF ]
##
## The known suffix of the stack is as follows:
## declaration
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Attributes String End With
##
## Ends in an error in state: 593.
##
## attr_decl -> open_attr_decl . option(SEMI) [ Type Recursive Function EOF Const Attributes ]
##
## The known suffix of the stack is as follows:
## open_attr_decl
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Attributes String RBRACKET
##
## Ends in an error in state: 555.
##
## ne_injection(Attributes,String) -> Attributes sep_or_term_list(String,SEMI) . End [ Type SEMI Recursive RBRACE Function End EOF Const Attributes ]
##
## The known suffix of the stack is as follows:
## Attributes sep_or_term_list(String,SEMI)
##
## 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).
## In state 543, spurious reduction of production nsepseq(String,SEMI) -> String 
## In state 554, spurious reduction of production sep_or_term_list(String,SEMI) -> nsepseq(String,SEMI) 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Attributes String SEMI String SEMI With
##
## Ends in an error in state: 546.
##
## nsepseq(String,SEMI) -> String SEMI . nsepseq(String,SEMI) [ RBRACKET End ]
## seq(__anonymous_0(String,SEMI)) -> String SEMI . seq(__anonymous_0(String,SEMI)) [ RBRACKET End ]
##
## The known suffix of the stack is as follows:
## String SEMI
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Attributes String SEMI String With
##
## Ends in an error in state: 545.
##
## nsepseq(String,SEMI) -> String . [ RBRACKET End ]
## nsepseq(String,SEMI) -> String . SEMI nsepseq(String,SEMI) [ RBRACKET End ]
## seq(__anonymous_0(String,SEMI)) -> String . SEMI seq(__anonymous_0(String,SEMI)) [ RBRACKET End ]
##
## The known suffix of the stack is as follows:
## String
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Attributes String SEMI With
##
## Ends in an error in state: 544.
##
## nsepseq(String,SEMI) -> String SEMI . nsepseq(String,SEMI) [ RBRACKET End ]
## nseq(__anonymous_0(String,SEMI)) -> String SEMI . seq(__anonymous_0(String,SEMI)) [ RBRACKET End ]
##
## The known suffix of the stack is as follows:
## String SEMI
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Attributes String With
##
## Ends in an error in state: 543.
##
## nsepseq(String,SEMI) -> String . [ RBRACKET End ]
## nsepseq(String,SEMI) -> String . SEMI nsepseq(String,SEMI) [ RBRACKET End ]
## nseq(__anonymous_0(String,SEMI)) -> String . SEMI seq(__anonymous_0(String,SEMI)) [ RBRACKET End ]
##
## The known suffix of the stack is as follows:
## String
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Attributes With
##
## Ends in an error in state: 542.
##
## ne_injection(Attributes,String) -> Attributes . sep_or_term_list(String,SEMI) End [ Type SEMI Recursive RBRACE Function End EOF Const Attributes ]
## ne_injection(Attributes,String) -> Attributes . LBRACKET sep_or_term_list(String,SEMI) RBRACKET [ Type SEMI Recursive RBRACE Function End EOF Const Attributes ]
##
## The known suffix of the stack is as follows:
## Attributes
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Const Ident COLON Ident EQ Bytes VBAR
##
## Ends in an error in state: 591.
##
## const_decl -> open_const_decl . option(SEMI) [ Type Recursive Function EOF Const Attributes ]
##
## The known suffix of the stack is as follows:
## open_const_decl
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
## In state 499, spurious reduction of production unqualified_decl(EQ) -> Ident COLON type_expr EQ expr 
## In state 500, spurious reduction of production open_const_decl -> Const unqualified_decl(EQ) 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Const Ident COLON Ident EQ With
##
## Ends in an error in state: 498.
##
## unqualified_decl(EQ) -> Ident COLON type_expr EQ . expr [ Type SEMI Recursive RBRACE Function End EOF Const Attributes ]
##
## The known suffix of the stack is as follows:
## Ident COLON type_expr EQ
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Const Ident COLON Ident VBAR
##
## Ends in an error in state: 497.
##
## unqualified_decl(EQ) -> Ident COLON type_expr . EQ expr [ Type SEMI Recursive RBRACE Function End EOF Const Attributes ]
##
## The known suffix of the stack is as follows:
## Ident COLON type_expr
##
## 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).
## In state 15, spurious reduction of production core_type -> Ident 
## In state 29, spurious reduction of production cartesian -> core_type 
## In state 35, spurious reduction of production fun_type -> cartesian 
## In state 43, spurious reduction of production type_expr -> fun_type 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Const Ident COLON With
##
## Ends in an error in state: 496.
##
## unqualified_decl(EQ) -> Ident COLON . type_expr EQ expr [ Type SEMI Recursive RBRACE Function End EOF Const Attributes ]
##
## The known suffix of the stack is as follows:
## Ident COLON
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Const Ident With
##
## Ends in an error in state: 495.
##
## unqualified_decl(EQ) -> Ident . COLON type_expr EQ expr [ Type SEMI Recursive RBRACE Function End EOF Const Attributes ]
##
## The known suffix of the stack is as follows:
## Ident
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Const With
##
## Ends in an error in state: 494.
##
## open_const_decl -> Const . unqualified_decl(EQ) [ Type SEMI Recursive RBRACE Function End EOF Const Attributes ]
##
## The known suffix of the stack is as follows:
## Const
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Case Unit Of LBRACKET VBAR Block
##
## Ends in an error in state: 505.
##
## case(if_clause) -> Case expr Of LBRACKET option(VBAR) . cases(if_clause) RBRACKET [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## Case expr Of LBRACKET option(VBAR)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Case Unit Of LBRACKET WILD ARROW Skip End
##
## Ends in an error in state: 534.
##
## case(if_clause) -> Case expr Of LBRACKET option(VBAR) cases(if_clause) . RBRACKET [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## Case expr Of LBRACKET option(VBAR) cases(if_clause)
##
## 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).
## In state 536, spurious reduction of production nsepseq(case_clause(if_clause),VBAR) -> case_clause(if_clause) 
## In state 533, spurious reduction of production cases(if_clause) -> nsepseq(case_clause(if_clause),VBAR) 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Case Unit Of LBRACKET With
##
## Ends in an error in state: 504.
##
## case(if_clause) -> Case expr Of LBRACKET . option(VBAR) cases(if_clause) RBRACKET [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## Case expr Of LBRACKET
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Case Unit Of VBAR Block
##
## Ends in an error in state: 539.
##
## case(if_clause) -> Case expr Of option(VBAR) . cases(if_clause) End [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## Case expr Of option(VBAR)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Case Unit Of WILD ARROW Skip RBRACKET
##
## Ends in an error in state: 540.
##
## case(if_clause) -> Case expr Of option(VBAR) cases(if_clause) . End [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## Case expr Of option(VBAR) cases(if_clause)
##
## 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).
## In state 536, spurious reduction of production nsepseq(case_clause(if_clause),VBAR) -> case_clause(if_clause) 
## In state 533, spurious reduction of production cases(if_clause) -> nsepseq(case_clause(if_clause),VBAR) 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Case Unit Of WILD ARROW Skip VBAR With
##
## Ends in an error in state: 537.
##
## nsepseq(case_clause(if_clause),VBAR) -> case_clause(if_clause) VBAR . nsepseq(case_clause(if_clause),VBAR) [ RBRACKET End ]
##
## The known suffix of the stack is as follows:
## case_clause(if_clause) VBAR
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Case Unit Of WILD ARROW Skip With
##
## Ends in an error in state: 536.
##
## nsepseq(case_clause(if_clause),VBAR) -> case_clause(if_clause) . [ RBRACKET End ]
## nsepseq(case_clause(if_clause),VBAR) -> case_clause(if_clause) . VBAR nsepseq(case_clause(if_clause),VBAR) [ RBRACKET End ]
##
## The known suffix of the stack is as follows:
## case_clause(if_clause)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Case Unit Of WILD ARROW With
##
## Ends in an error in state: 507.
##
## case_clause(if_clause) -> pattern ARROW . if_clause [ VBAR RBRACKET End ]
##
## The known suffix of the stack is as follows:
## pattern ARROW
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Case Unit Of WILD RPAR
##
## Ends in an error in state: 506.
##
## case_clause(if_clause) -> pattern . ARROW if_clause [ VBAR RBRACKET End ]
##
## The known suffix of the stack is as follows:
## 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).
## In state 298, spurious reduction of production pattern -> core_pattern 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Case Unit Of With
##
## Ends in an error in state: 503.
##
## case(if_clause) -> Case expr Of . option(VBAR) cases(if_clause) End [ VBAR SEMI RBRACKET RBRACE End Else ]
## case(if_clause) -> Case expr Of . LBRACKET option(VBAR) cases(if_clause) RBRACKET [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## Case expr Of
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Case Unit VBAR
##
## Ends in an error in state: 502.
##
## case(if_clause) -> Case expr . Of option(VBAR) cases(if_clause) End [ VBAR SEMI RBRACKET RBRACE End Else ]
## case(if_clause) -> Case expr . Of LBRACKET option(VBAR) cases(if_clause) RBRACKET [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## Case expr
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Case With
##
## Ends in an error in state: 501.
##
## case(if_clause) -> Case . expr Of option(VBAR) cases(if_clause) End [ VBAR SEMI RBRACKET RBRACE End Else ]
## case(if_clause) -> Case . expr Of LBRACKET option(VBAR) cases(if_clause) RBRACKET [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## Case
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Constr DOT And With
##
## Ends in an error in state: 514.
##
## fun_call -> module_field . arguments [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## module_field
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Constr With
##
## Ends in an error in state: 493.
##
## module_field -> Constr . DOT module_fun [ LPAR ]
## projection -> Constr . DOT Ident DOT nsepseq(selection,DOT) [ LBRACKET ASS ]
##
## The known suffix of the stack is as follows:
## Constr
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin For Ident ARROW Ident With
##
## Ends in an error in state: 477.
##
## for_loop -> For Ident option(arrow_clause) . In collection expr block [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## For Ident option(arrow_clause)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin For Ident ARROW With
##
## Ends in an error in state: 475.
##
## arrow_clause -> ARROW . Ident [ In ]
##
## The known suffix of the stack is as follows:
## ARROW
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin For Ident ASS Bytes To Unit Step Unit VBAR
##
## Ends in an error in state: 490.
##
## for_loop -> For var_assign To expr Step expr . block [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## For var_assign To expr Step expr
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin For Ident ASS Bytes To Unit Step With
##
## Ends in an error in state: 489.
##
## for_loop -> For var_assign To expr Step . expr block [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## For var_assign To expr Step
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin For Ident ASS Bytes To Unit VBAR
##
## Ends in an error in state: 488.
##
## for_loop -> For var_assign To expr . block [ VBAR SEMI RBRACKET RBRACE End Else ]
## for_loop -> For var_assign To expr . Step expr block [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## For var_assign To expr
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin For Ident ASS Bytes To With
##
## Ends in an error in state: 487.
##
## for_loop -> For var_assign To . expr block [ VBAR SEMI RBRACKET RBRACE End Else ]
## for_loop -> For var_assign To . expr Step expr block [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## For var_assign To
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin For Ident ASS Bytes VBAR
##
## Ends in an error in state: 486.
##
## for_loop -> For var_assign . To expr block [ VBAR SEMI RBRACKET RBRACE End Else ]
## for_loop -> For var_assign . To expr Step expr block [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## For var_assign
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
## In state 474, spurious reduction of production var_assign -> Ident ASS expr 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin For Ident ASS With
##
## Ends in an error in state: 473.
##
## var_assign -> Ident ASS . expr [ To ]
##
## The known suffix of the stack is as follows:
## Ident ASS
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin For Ident In Set Unit VBAR
##
## Ends in an error in state: 483.
##
## for_loop -> For Ident option(arrow_clause) In collection expr . block [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## For Ident option(arrow_clause) In collection expr
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin For Ident In Set With
##
## Ends in an error in state: 482.
##
## for_loop -> For Ident option(arrow_clause) In collection . expr block [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## For Ident option(arrow_clause) In collection
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin For Ident In With
##
## Ends in an error in state: 478.
##
## for_loop -> For Ident option(arrow_clause) In . collection expr block [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## For Ident option(arrow_clause) In
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin For Ident With
##
## Ends in an error in state: 472.
##
## for_loop -> For Ident . option(arrow_clause) In collection expr block [ VBAR SEMI RBRACKET RBRACE End Else ]
## var_assign -> Ident . ASS expr [ To ]
##
## The known suffix of the stack is as follows:
## For Ident
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin For With
##
## Ends in an error in state: 471.
##
## for_loop -> For . var_assign To expr block [ VBAR SEMI RBRACKET RBRACE End Else ]
## for_loop -> For . var_assign To expr Step expr block [ VBAR SEMI RBRACKET RBRACE End Else ]
## for_loop -> For . Ident option(arrow_clause) In collection expr block [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## For
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Ident ASS With
##
## Ends in an error in state: 520.
##
## assignment -> lhs ASS . rhs [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## lhs ASS
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Ident DOT Ident With
##
## Ends in an error in state: 513.
##
## lhs -> path . [ ASS ]
## map_lookup -> path . brackets(expr) [ ASS ]
##
## The known suffix of the stack is as follows:
## path
##
## 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).
## In state 130, spurious reduction of production nsepseq(selection,DOT) -> selection 
## In state 342, spurious reduction of production projection -> Ident DOT nsepseq(selection,DOT) 
## In state 428, spurious reduction of production path -> projection 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Ident LBRACKET Bytes RBRACKET With
##
## Ends in an error in state: 519.
##
## assignment -> lhs . ASS rhs [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## lhs
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Ident With
##
## Ends in an error in state: 460.
##
## fun_call -> Ident . arguments [ VBAR SEMI RBRACKET RBRACE End Else ]
## path -> Ident . [ LBRACKET ASS ]
## projection -> Ident . DOT nsepseq(selection,DOT) [ LBRACKET ASS ]
##
## The known suffix of the stack is as follows:
## Ident
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin If Unit Then LBRACE Skip End
##
## Ends in an error in state: 571.
##
## clause_block -> LBRACE sep_or_term_list(statement,SEMI) . RBRACE [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## LBRACE sep_or_term_list(statement,SEMI)
##
## 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).
## In state 557, spurious reduction of production nsepseq(statement,SEMI) -> statement 
## In state 574, spurious reduction of production sep_or_term_list(statement,SEMI) -> nsepseq(statement,SEMI) 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin If Unit Then LBRACE With
##
## Ends in an error in state: 459.
##
## clause_block -> LBRACE . sep_or_term_list(statement,SEMI) RBRACE [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## LBRACE
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin If Unit Then Skip Else With
##
## Ends in an error in state: 577.
##
## conditional -> If expr Then if_clause option(SEMI) Else . if_clause [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## If expr Then if_clause option(SEMI) Else
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin If Unit Then Skip SEMI EQ
##
## Ends in an error in state: 576.
##
## conditional -> If expr Then if_clause option(SEMI) . Else if_clause [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## If expr Then if_clause option(SEMI)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin If Unit Then Skip With
##
## Ends in an error in state: 575.
##
## conditional -> If expr Then if_clause . option(SEMI) Else if_clause [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## If expr Then if_clause
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin If Unit Then With
##
## Ends in an error in state: 458.
##
## conditional -> If expr Then . if_clause option(SEMI) Else if_clause [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## If expr Then
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin If Unit VBAR
##
## Ends in an error in state: 457.
##
## conditional -> If expr . Then if_clause option(SEMI) Else if_clause [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## If expr
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin If With
##
## Ends in an error in state: 456.
##
## conditional -> If . expr Then if_clause option(SEMI) Else if_clause [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## If
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Patch Constr DOT Ident With
##
## Ends in an error in state: 427.
##
## projection -> Constr DOT Ident . DOT nsepseq(selection,DOT) [ With VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## Constr DOT Ident
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Patch Constr DOT With
##
## Ends in an error in state: 426.
##
## projection -> Constr DOT . Ident DOT nsepseq(selection,DOT) [ With VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## Constr DOT
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Patch Constr With
##
## Ends in an error in state: 425.
##
## projection -> Constr . DOT Ident DOT nsepseq(selection,DOT) [ With VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## Constr
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Patch Ident VBAR
##
## Ends in an error in state: 433.
##
## map_patch -> Patch path . With ne_injection(Map,binding) [ VBAR SEMI RBRACKET RBRACE End Else ]
## record_patch -> Patch path . With ne_injection(Record,field_assignment) [ VBAR SEMI RBRACKET RBRACE End Else ]
## set_patch -> Patch path . With ne_injection(Set,expr) [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## Patch path
##
## 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).
## In state 424, spurious reduction of production path -> Ident 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Patch Ident While
##
## Ends in an error in state: 424.
##
## path -> Ident . [ With VBAR SEMI RBRACKET RBRACE End Else ]
## projection -> Ident . DOT nsepseq(selection,DOT) [ With VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## Ident
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Patch Ident With Map LBRACKET Unit ARROW Bytes End
##
## Ends in an error in state: 449.
##
## ne_injection(Map,binding) -> Map LBRACKET sep_or_term_list(binding,SEMI) . RBRACKET [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## Map LBRACKET sep_or_term_list(binding,SEMI)
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
## In state 248, spurious reduction of production binding -> expr ARROW expr 
## In state 249, spurious reduction of production nsepseq(binding,SEMI) -> binding 
## In state 245, spurious reduction of production sep_or_term_list(binding,SEMI) -> nsepseq(binding,SEMI) 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Patch Ident With Map LBRACKET With
##
## Ends in an error in state: 448.
##
## ne_injection(Map,binding) -> Map LBRACKET . sep_or_term_list(binding,SEMI) RBRACKET [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## Map LBRACKET
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Patch Ident With Map Unit ARROW Bytes RBRACKET
##
## Ends in an error in state: 451.
##
## ne_injection(Map,binding) -> Map sep_or_term_list(binding,SEMI) . End [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## Map sep_or_term_list(binding,SEMI)
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
## In state 248, spurious reduction of production binding -> expr ARROW expr 
## In state 249, spurious reduction of production nsepseq(binding,SEMI) -> binding 
## In state 245, spurious reduction of production sep_or_term_list(binding,SEMI) -> nsepseq(binding,SEMI) 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Patch Ident With Map With
##
## Ends in an error in state: 447.
##
## ne_injection(Map,binding) -> Map . sep_or_term_list(binding,SEMI) End [ VBAR SEMI RBRACKET RBRACE End Else ]
## ne_injection(Map,binding) -> Map . LBRACKET sep_or_term_list(binding,SEMI) RBRACKET [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## Map
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Patch Ident With Record Ident EQ Bytes RBRACKET
##
## Ends in an error in state: 445.
##
## ne_injection(Record,field_assignment) -> Record sep_or_term_list(field_assignment,SEMI) . End [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## Record sep_or_term_list(field_assignment,SEMI)
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
## In state 385, spurious reduction of production field_assignment -> Ident EQ expr 
## In state 390, spurious reduction of production nsepseq(field_assignment,SEMI) -> field_assignment 
## In state 389, spurious reduction of production sep_or_term_list(field_assignment,SEMI) -> nsepseq(field_assignment,SEMI) 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Patch Ident With Record LBRACKET Ident EQ Bytes End
##
## Ends in an error in state: 443.
##
## ne_injection(Record,field_assignment) -> Record LBRACKET sep_or_term_list(field_assignment,SEMI) . RBRACKET [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## Record LBRACKET sep_or_term_list(field_assignment,SEMI)
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
## In state 385, spurious reduction of production field_assignment -> Ident EQ expr 
## In state 390, spurious reduction of production nsepseq(field_assignment,SEMI) -> field_assignment 
## In state 389, spurious reduction of production sep_or_term_list(field_assignment,SEMI) -> nsepseq(field_assignment,SEMI) 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Patch Ident With Record LBRACKET With
##
## Ends in an error in state: 442.
##
## ne_injection(Record,field_assignment) -> Record LBRACKET . sep_or_term_list(field_assignment,SEMI) RBRACKET [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## Record LBRACKET
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Patch Ident With Record With
##
## Ends in an error in state: 441.
##
## ne_injection(Record,field_assignment) -> Record . sep_or_term_list(field_assignment,SEMI) End [ VBAR SEMI RBRACKET RBRACE End Else ]
## ne_injection(Record,field_assignment) -> Record . LBRACKET sep_or_term_list(field_assignment,SEMI) RBRACKET [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## Record
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Patch Ident With Set LBRACKET Unit End
##
## Ends in an error in state: 437.
##
## ne_injection(Set,expr) -> Set LBRACKET sep_or_term_list(expr,SEMI) . RBRACKET [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## Set LBRACKET sep_or_term_list(expr,SEMI)
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
## In state 366, spurious reduction of production nsepseq(expr,SEMI) -> expr 
## In state 365, spurious reduction of production sep_or_term_list(expr,SEMI) -> nsepseq(expr,SEMI) 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Patch Ident With Set LBRACKET With
##
## Ends in an error in state: 436.
##
## ne_injection(Set,expr) -> Set LBRACKET . sep_or_term_list(expr,SEMI) RBRACKET [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## Set LBRACKET
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Patch Ident With Set Unit RBRACKET
##
## Ends in an error in state: 439.
##
## ne_injection(Set,expr) -> Set sep_or_term_list(expr,SEMI) . End [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## Set sep_or_term_list(expr,SEMI)
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
## In state 366, spurious reduction of production nsepseq(expr,SEMI) -> expr 
## In state 365, spurious reduction of production sep_or_term_list(expr,SEMI) -> nsepseq(expr,SEMI) 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Patch Ident With Set With
##
## Ends in an error in state: 435.
##
## ne_injection(Set,expr) -> Set . sep_or_term_list(expr,SEMI) End [ VBAR SEMI RBRACKET RBRACE End Else ]
## ne_injection(Set,expr) -> Set . LBRACKET sep_or_term_list(expr,SEMI) RBRACKET [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## Set
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Patch Ident With With
##
## Ends in an error in state: 434.
##
## map_patch -> Patch path With . ne_injection(Map,binding) [ VBAR SEMI RBRACKET RBRACE End Else ]
## record_patch -> Patch path With . ne_injection(Record,field_assignment) [ VBAR SEMI RBRACKET RBRACE End Else ]
## set_patch -> Patch path With . ne_injection(Set,expr) [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## Patch path With
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Patch With
##
## Ends in an error in state: 432.
##
## map_patch -> Patch . path With ne_injection(Map,binding) [ VBAR SEMI RBRACKET RBRACE End Else ]
## record_patch -> Patch . path With ne_injection(Record,field_assignment) [ VBAR SEMI RBRACKET RBRACE End Else ]
## set_patch -> Patch . path With ne_injection(Set,expr) [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## Patch
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Remove Unit From Map With
##
## Ends in an error in state: 430.
##
## map_remove -> Remove expr From Map . path [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## Remove expr From Map
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Remove Unit From Set With
##
## Ends in an error in state: 423.
##
## set_remove -> Remove expr From Set . path [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## Remove expr From Set
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Remove Unit From With
##
## Ends in an error in state: 422.
##
## map_remove -> Remove expr From . Map path [ VBAR SEMI RBRACKET RBRACE End Else ]
## set_remove -> Remove expr From . Set path [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## Remove expr From
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Remove Unit VBAR
##
## Ends in an error in state: 421.
##
## map_remove -> Remove expr . From Map path [ VBAR SEMI RBRACKET RBRACE End Else ]
## set_remove -> Remove expr . From Set path [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## Remove expr
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Remove With
##
## Ends in an error in state: 420.
##
## map_remove -> Remove . expr From Map path [ VBAR SEMI RBRACKET RBRACE End Else ]
## set_remove -> Remove . expr From Set path [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## Remove
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Skip End While
##
## Ends in an error in state: 468.
##
## open_fun_decl -> Function Ident parameters COLON type_expr Is block . With expr [ Type SEMI Recursive RBRACE Function End EOF Const Attributes ]
##
## The known suffix of the stack is as follows:
## Function Ident parameters COLON type_expr Is block
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Skip End With With
##
## Ends in an error in state: 469.
##
## open_fun_decl -> Function Ident parameters COLON type_expr Is block With . expr [ Type SEMI Recursive RBRACE Function End EOF Const Attributes ]
##
## The known suffix of the stack is as follows:
## Function Ident parameters COLON type_expr Is block With
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Skip RBRACE
##
## Ends in an error in state: 579.
##
## block -> Begin sep_or_term_list(statement,SEMI) . End [ With VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## Begin sep_or_term_list(statement,SEMI)
##
## 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).
## In state 557, spurious reduction of production nsepseq(statement,SEMI) -> statement 
## In state 574, spurious reduction of production sep_or_term_list(statement,SEMI) -> nsepseq(statement,SEMI) 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Skip SEMI Skip SEMI With
##
## Ends in an error in state: 560.
##
## nsepseq(statement,SEMI) -> statement SEMI . nsepseq(statement,SEMI) [ RBRACE End ]
## seq(__anonymous_0(statement,SEMI)) -> statement SEMI . seq(__anonymous_0(statement,SEMI)) [ RBRACE End ]
##
## The known suffix of the stack is as follows:
## statement SEMI
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Skip SEMI Skip With
##
## Ends in an error in state: 559.
##
## nsepseq(statement,SEMI) -> statement . [ RBRACE End ]
## nsepseq(statement,SEMI) -> statement . SEMI nsepseq(statement,SEMI) [ RBRACE End ]
## seq(__anonymous_0(statement,SEMI)) -> statement . SEMI seq(__anonymous_0(statement,SEMI)) [ RBRACE End ]
##
## The known suffix of the stack is as follows:
## statement
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Skip SEMI With
##
## Ends in an error in state: 558.
##
## nsepseq(statement,SEMI) -> statement SEMI . nsepseq(statement,SEMI) [ RBRACE End ]
## nseq(__anonymous_0(statement,SEMI)) -> statement SEMI . seq(__anonymous_0(statement,SEMI)) [ RBRACE End ]
##
## The known suffix of the stack is as follows:
## statement SEMI
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Skip With
##
## Ends in an error in state: 557.
##
## nsepseq(statement,SEMI) -> statement . [ RBRACE End ]
## nsepseq(statement,SEMI) -> statement . SEMI nsepseq(statement,SEMI) [ RBRACE End ]
## nseq(__anonymous_0(statement,SEMI)) -> statement . SEMI seq(__anonymous_0(statement,SEMI)) [ RBRACE End ]
##
## The known suffix of the stack is as follows:
## statement
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Var Ident COLON Ident ASS With
##
## Ends in an error in state: 416.
##
## unqualified_decl(ASS) -> Ident COLON type_expr ASS . expr [ SEMI RBRACE End ]
##
## The known suffix of the stack is as follows:
## Ident COLON type_expr ASS
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Var Ident COLON Ident VBAR
##
## Ends in an error in state: 415.
##
## unqualified_decl(ASS) -> Ident COLON type_expr . ASS expr [ SEMI RBRACE End ]
##
## The known suffix of the stack is as follows:
## Ident COLON type_expr
##
## 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).
## In state 15, spurious reduction of production core_type -> Ident 
## In state 29, spurious reduction of production cartesian -> core_type 
## In state 35, spurious reduction of production fun_type -> cartesian 
## In state 43, spurious reduction of production type_expr -> fun_type 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Var Ident COLON With
##
## Ends in an error in state: 414.
##
## unqualified_decl(ASS) -> Ident COLON . type_expr ASS expr [ SEMI RBRACE End ]
##
## The known suffix of the stack is as follows:
## Ident COLON
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Var Ident With
##
## Ends in an error in state: 413.
##
## unqualified_decl(ASS) -> Ident . COLON type_expr ASS expr [ SEMI RBRACE End ]
##
## The known suffix of the stack is as follows:
## Ident
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Var With
##
## Ends in an error in state: 412.
##
## open_var_decl -> Var . unqualified_decl(ASS) [ SEMI RBRACE End ]
##
## The known suffix of the stack is as follows:
## Var
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin While Unit VBAR
##
## Ends in an error in state: 410.
##
## while_loop -> While expr . block [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## While expr
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin While With
##
## Ends in an error in state: 409.
##
## while_loop -> While . expr block [ VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## While
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin With
##
## Ends in an error in state: 411.
##
## block -> Begin . sep_or_term_list(statement,SEMI) End [ With VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## Begin
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Block LBRACE Skip End
##
## Ends in an error in state: 582.
##
## block -> Block LBRACE sep_or_term_list(statement,SEMI) . RBRACE [ With VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## Block LBRACE sep_or_term_list(statement,SEMI)
##
## 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).
## In state 557, spurious reduction of production nsepseq(statement,SEMI) -> statement 
## In state 574, spurious reduction of production sep_or_term_list(statement,SEMI) -> nsepseq(statement,SEMI) 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Block LBRACE With
##
## Ends in an error in state: 408.
##
## block -> Block LBRACE . sep_or_term_list(statement,SEMI) RBRACE [ With VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## Block LBRACE
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Block With
##
## Ends in an error in state: 407.
##
## block -> Block . LBRACE sep_or_term_list(statement,SEMI) RBRACE [ With VBAR SEMI RBRACKET RBRACE End Else ]
##
## The known suffix of the stack is as follows:
## Block
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Bytes VBAR
##
## Ends in an error in state: 589.
##
## fun_decl -> open_fun_decl . option(SEMI) [ Type Recursive Function EOF Const Attributes ]
##
## The known suffix of the stack is as follows:
## open_fun_decl
##
## 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).
## In state 197, spurious reduction of production unary_expr -> core_expr 
## In state 147, spurious reduction of production mult_expr -> unary_expr 
## In state 173, spurious reduction of production add_expr -> mult_expr 
## In state 203, spurious reduction of production cons_expr -> add_expr 
## In state 200, spurious reduction of production cat_expr -> cons_expr 
## In state 223, spurious reduction of production comp_expr -> cat_expr 
## In state 210, spurious reduction of production set_membership -> comp_expr 
## In state 149, spurious reduction of production conj_expr -> set_membership 
## In state 227, spurious reduction of production disj_expr -> conj_expr 
## In state 195, spurious reduction of production expr -> disj_expr 
## In state 467, spurious reduction of production open_fun_decl -> Function Ident parameters COLON type_expr Is expr 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is With
##
## Ends in an error in state: 466.
##
## open_fun_decl -> Function Ident parameters COLON type_expr Is . block With expr [ Type SEMI Recursive RBRACE Function End EOF Const Attributes ]
## open_fun_decl -> Function Ident parameters COLON type_expr Is . expr [ Type SEMI Recursive RBRACE Function End EOF Const Attributes ]
##
## The known suffix of the stack is as follows:
## Function Ident parameters COLON type_expr Is
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident VBAR
##
## Ends in an error in state: 465.
##
## open_fun_decl -> Function Ident parameters COLON type_expr . Is block With expr [ Type SEMI Recursive RBRACE Function End EOF Const Attributes ]
## open_fun_decl -> Function Ident parameters COLON type_expr . Is expr [ Type SEMI Recursive RBRACE Function End EOF Const Attributes ]
##
## The known suffix of the stack is as follows:
## Function Ident parameters COLON type_expr
##
## 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).
## In state 15, spurious reduction of production core_type -> Ident 
## In state 29, spurious reduction of production cartesian -> core_type 
## In state 35, spurious reduction of production fun_type -> cartesian 
## In state 43, spurious reduction of production type_expr -> fun_type 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR COLON With
##
## Ends in an error in state: 464.
##
## open_fun_decl -> Function Ident parameters COLON . type_expr Is block With expr [ Type SEMI Recursive RBRACE Function End EOF Const Attributes ]
## open_fun_decl -> Function Ident parameters COLON . type_expr Is expr [ Type SEMI Recursive RBRACE Function End EOF Const Attributes ]
##
## The known suffix of the stack is as follows:
## Function Ident parameters COLON
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident LPAR Const Ident COLON Ident RPAR With
##
## Ends in an error in state: 463.
##
## open_fun_decl -> Function Ident parameters . COLON type_expr Is block With expr [ Type SEMI Recursive RBRACE Function End EOF Const Attributes ]
## open_fun_decl -> Function Ident parameters . COLON type_expr Is expr [ Type SEMI Recursive RBRACE Function End EOF Const Attributes ]
##
## The known suffix of the stack is as follows:
## Function Ident parameters
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function Ident With
##
## Ends in an error in state: 462.
##
## open_fun_decl -> Function Ident . parameters COLON type_expr Is block With expr [ Type SEMI Recursive RBRACE Function End EOF Const Attributes ]
## open_fun_decl -> Function Ident . parameters COLON type_expr Is expr [ Type SEMI Recursive RBRACE Function End EOF Const Attributes ]
##
## The known suffix of the stack is as follows:
## Function Ident
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Function With
##
## Ends in an error in state: 461.
##
## open_fun_decl -> Function . Ident parameters COLON type_expr Is block With expr [ Type SEMI Recursive RBRACE Function End EOF Const Attributes ]
## open_fun_decl -> Function . Ident parameters COLON type_expr Is expr [ Type SEMI Recursive RBRACE Function End EOF Const Attributes ]
##
## The known suffix of the stack is as follows:
## Function
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Recursive Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Skip End While
##
## Ends in an error in state: 585.
##
## open_fun_decl -> Recursive Function Ident parameters COLON type_expr Is block . With expr [ Type SEMI Recursive RBRACE Function End EOF Const Attributes ]
##
## The known suffix of the stack is as follows:
## Recursive Function Ident parameters COLON type_expr Is block
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Recursive Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is Begin Skip End With With
##
## Ends in an error in state: 586.
##
## open_fun_decl -> Recursive Function Ident parameters COLON type_expr Is block With . expr [ Type SEMI Recursive RBRACE Function End EOF Const Attributes ]
##
## The known suffix of the stack is as follows:
## Recursive Function Ident parameters COLON type_expr Is block With
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Recursive Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident Is With
##
## Ends in an error in state: 88.
##
## open_fun_decl -> Recursive Function Ident parameters COLON type_expr Is . block With expr [ Type SEMI Recursive RBRACE Function End EOF Const Attributes ]
## open_fun_decl -> Recursive Function Ident parameters COLON type_expr Is . expr [ Type SEMI Recursive RBRACE Function End EOF Const Attributes ]
##
## The known suffix of the stack is as follows:
## Recursive Function Ident parameters COLON type_expr Is
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Recursive Function Ident LPAR Const Ident COLON Ident RPAR COLON Ident VBAR
##
## Ends in an error in state: 87.
##
## open_fun_decl -> Recursive Function Ident parameters COLON type_expr . Is block With expr [ Type SEMI Recursive RBRACE Function End EOF Const Attributes ]
## open_fun_decl -> Recursive Function Ident parameters COLON type_expr . Is expr [ Type SEMI Recursive RBRACE Function End EOF Const Attributes ]
##
## The known suffix of the stack is as follows:
## Recursive Function Ident parameters COLON type_expr
##
## 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).
## In state 15, spurious reduction of production core_type -> Ident 
## In state 29, spurious reduction of production cartesian -> core_type 
## In state 35, spurious reduction of production fun_type -> cartesian 
## In state 43, spurious reduction of production type_expr -> fun_type 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Recursive Function Ident LPAR Const Ident COLON Ident RPAR COLON With
##
## Ends in an error in state: 86.
##
## open_fun_decl -> Recursive Function Ident parameters COLON . type_expr Is block With expr [ Type SEMI Recursive RBRACE Function End EOF Const Attributes ]
## open_fun_decl -> Recursive Function Ident parameters COLON . type_expr Is expr [ Type SEMI Recursive RBRACE Function End EOF Const Attributes ]
##
## The known suffix of the stack is as follows:
## Recursive Function Ident parameters COLON
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Recursive Function Ident LPAR Const Ident COLON Ident RPAR With
##
## Ends in an error in state: 85.
##
## open_fun_decl -> Recursive Function Ident parameters . COLON type_expr Is block With expr [ Type SEMI Recursive RBRACE Function End EOF Const Attributes ]
## open_fun_decl -> Recursive Function Ident parameters . COLON type_expr Is expr [ Type SEMI Recursive RBRACE Function End EOF Const Attributes ]
##
## The known suffix of the stack is as follows:
## Recursive Function Ident parameters
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Recursive Function Ident With
##
## Ends in an error in state: 69.
##
## open_fun_decl -> Recursive Function Ident . parameters COLON type_expr Is block With expr [ Type SEMI Recursive RBRACE Function End EOF Const Attributes ]
## open_fun_decl -> Recursive Function Ident . parameters COLON type_expr Is expr [ Type SEMI Recursive RBRACE Function End EOF Const Attributes ]
##
## The known suffix of the stack is as follows:
## Recursive Function Ident
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Recursive Function With
##
## Ends in an error in state: 68.
##
## open_fun_decl -> Recursive Function . Ident parameters COLON type_expr Is block With expr [ Type SEMI Recursive RBRACE Function End EOF Const Attributes ]
## open_fun_decl -> Recursive Function . Ident parameters COLON type_expr Is expr [ Type SEMI Recursive RBRACE Function End EOF Const Attributes ]
##
## The known suffix of the stack is as follows:
## Recursive Function
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Recursive With
##
## Ends in an error in state: 67.
##
## open_fun_decl -> Recursive . Function Ident parameters COLON type_expr Is block With expr [ Type SEMI Recursive RBRACE Function End EOF Const Attributes ]
## open_fun_decl -> Recursive . Function Ident parameters COLON type_expr Is expr [ Type SEMI Recursive RBRACE Function End EOF Const Attributes ]
##
## The known suffix of the stack is as follows:
## Recursive
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident Is BigMap With
##
## Ends in an error in state: 18.
##
## core_type -> BigMap . type_tuple [ VBAR Type TIMES SEMI Recursive RPAR RBRACKET Is Function End EQ EOF Const COMMA Attributes ASS ARROW ]
##
## The known suffix of the stack is as follows:
## BigMap
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident Is Constr Of With
##
## Ends in an error in state: 27.
##
## variant -> Constr Of . fun_type [ VBAR Type SEMI Recursive RPAR RBRACKET Is Function End EQ EOF Const COMMA Attributes ASS ]
##
## The known suffix of the stack is as follows:
## Constr Of
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident Is Constr VBAR With
##
## Ends in an error in state: 39.
##
## nsepseq(variant,VBAR) -> variant VBAR . nsepseq(variant,VBAR) [ Type SEMI Recursive RPAR RBRACKET Is Function End EQ EOF Const COMMA Attributes ASS ]
##
## The known suffix of the stack is as follows:
## variant VBAR
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident Is Constr With
##
## Ends in an error in state: 26.
##
## variant -> Constr . [ VBAR Type SEMI Recursive RPAR RBRACKET Is Function End EQ EOF Const COMMA Attributes ASS ]
## variant -> Constr . Of fun_type [ VBAR Type SEMI Recursive RPAR RBRACKET Is Function End EQ EOF Const COMMA Attributes ASS ]
##
## The known suffix of the stack is as follows:
## Constr
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident Is Ident ARROW With
##
## Ends in an error in state: 36.
##
## fun_type -> cartesian ARROW . fun_type [ VBAR Type SEMI Recursive RPAR RBRACKET Is Function End EQ EOF Const COMMA Attributes ASS ]
##
## The known suffix of the stack is as follows:
## cartesian ARROW
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident Is Ident TIMES Ident TIMES With
##
## Ends in an error in state: 33.
##
## nsepseq(core_type,TIMES) -> core_type TIMES . nsepseq(core_type,TIMES) [ VBAR Type SEMI Recursive RPAR RBRACKET Is Function End EQ EOF Const COMMA Attributes ASS ARROW ]
##
## The known suffix of the stack is as follows:
## core_type TIMES
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident Is Ident TIMES LPAR Ident RPAR With
##
## Ends in an error in state: 32.
##
## nsepseq(core_type,TIMES) -> core_type . [ VBAR Type SEMI Recursive RPAR RBRACKET Is Function End EQ EOF Const COMMA Attributes ASS ARROW ]
## nsepseq(core_type,TIMES) -> core_type . TIMES nsepseq(core_type,TIMES) [ VBAR Type SEMI Recursive RPAR RBRACKET Is Function End EQ EOF Const COMMA Attributes ASS ARROW ]
##
## The known suffix of the stack is as follows:
## core_type
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident Is Ident TIMES With
##
## Ends in an error in state: 30.
##
## cartesian -> core_type TIMES . nsepseq(core_type,TIMES) [ VBAR Type SEMI Recursive RPAR RBRACKET Is Function End EQ EOF Const COMMA Attributes ASS ARROW ]
##
## The known suffix of the stack is as follows:
## core_type TIMES
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident Is Ident VBAR
##
## Ends in an error in state: 64.
##
## type_decl -> Type Ident Is type_expr . option(SEMI) [ Type Recursive Function EOF Const Attributes ]
##
## The known suffix of the stack is as follows:
## Type Ident Is type_expr
##
## 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).
## In state 15, spurious reduction of production core_type -> Ident 
## In state 29, spurious reduction of production cartesian -> core_type 
## In state 35, spurious reduction of production fun_type -> cartesian 
## In state 43, spurious reduction of production type_expr -> fun_type 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident Is Ident With
##
## Ends in an error in state: 15.
##
## core_type -> Ident . [ VBAR Type TIMES SEMI Recursive RPAR RBRACKET Is Function End EQ EOF Const COMMA Attributes ASS ARROW ]
## core_type -> Ident . type_tuple [ VBAR Type TIMES SEMI Recursive RPAR RBRACKET Is Function End EQ EOF Const COMMA Attributes ASS ARROW ]
##
## The known suffix of the stack is as follows:
## Ident
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident Is LPAR Constr RPAR With
##
## Ends in an error in state: 29.
##
## cartesian -> core_type . [ VBAR Type SEMI Recursive RPAR RBRACKET Is Function End EQ EOF Const COMMA Attributes ASS ARROW ]
## cartesian -> core_type . TIMES nsepseq(core_type,TIMES) [ VBAR Type SEMI Recursive RPAR RBRACKET Is Function End EQ EOF Const COMMA Attributes ASS ARROW ]
##
## The known suffix of the stack is as follows:
## core_type
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident Is LPAR Ident VBAR
##
## Ends in an error in state: 61.
##
## par(type_expr) -> LPAR type_expr . RPAR [ VBAR Type TIMES SEMI Recursive RPAR RBRACKET Is Function End EQ EOF Const COMMA Attributes ASS ARROW ]
##
## The known suffix of the stack is as follows:
## LPAR type_expr
##
## 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).
## In state 15, spurious reduction of production core_type -> Ident 
## In state 29, spurious reduction of production cartesian -> core_type 
## In state 35, spurious reduction of production fun_type -> cartesian 
## In state 43, spurious reduction of production type_expr -> fun_type 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident Is LPAR With
##
## Ends in an error in state: 6.
##
## par(type_expr) -> LPAR . type_expr RPAR [ VBAR Type TIMES SEMI Recursive RPAR RBRACKET Is Function End EQ EOF Const COMMA Attributes ASS ARROW ]
##
## The known suffix of the stack is as follows:
## LPAR
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident Is List With
##
## Ends in an error in state: 13.
##
## core_type -> List . par(type_expr) [ VBAR Type TIMES SEMI Recursive RPAR RBRACKET Is Function End EQ EOF Const COMMA Attributes ASS ARROW ]
##
## The known suffix of the stack is as follows:
## List
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident Is Map LPAR Ident COMMA With
##
## Ends in an error in state: 21.
##
## nsepseq(type_expr,COMMA) -> type_expr COMMA . nsepseq(type_expr,COMMA) [ RPAR ]
##
## The known suffix of the stack is as follows:
## type_expr COMMA
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident Is Map LPAR Ident VBAR
##
## Ends in an error in state: 20.
##
## nsepseq(type_expr,COMMA) -> type_expr . [ RPAR ]
## nsepseq(type_expr,COMMA) -> type_expr . COMMA nsepseq(type_expr,COMMA) [ RPAR ]
##
## The known suffix of the stack is as follows:
## type_expr
##
## 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).
## In state 15, spurious reduction of production core_type -> Ident 
## In state 29, spurious reduction of production cartesian -> core_type 
## In state 35, spurious reduction of production fun_type -> cartesian 
## In state 43, spurious reduction of production type_expr -> fun_type 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident Is Map LPAR With
##
## Ends in an error in state: 12.
##
## par(nsepseq(type_expr,COMMA)) -> LPAR . nsepseq(type_expr,COMMA) RPAR [ VBAR Type TIMES SEMI Recursive RPAR RBRACKET Is Function End EQ EOF Const COMMA Attributes ASS ARROW ]
##
## The known suffix of the stack is as follows:
## LPAR
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident Is Map With
##
## Ends in an error in state: 11.
##
## core_type -> Map . type_tuple [ VBAR Type TIMES SEMI Recursive RPAR RBRACKET Is Function End EQ EOF Const COMMA Attributes ASS ARROW ]
##
## The known suffix of the stack is as follows:
## Map
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident Is Record Ident COLON Ident RBRACKET
##
## Ends in an error in state: 59.
##
## record_type -> Record sep_or_term_list(field_decl,SEMI) . End [ Type SEMI Recursive RPAR RBRACKET Is Function End EQ EOF Const COMMA Attributes ASS ]
##
## The known suffix of the stack is as follows:
## Record sep_or_term_list(field_decl,SEMI)
##
## 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).
## In state 15, spurious reduction of production core_type -> Ident 
## In state 29, spurious reduction of production cartesian -> core_type 
## In state 35, spurious reduction of production fun_type -> cartesian 
## In state 43, spurious reduction of production type_expr -> fun_type 
## In state 47, spurious reduction of production field_decl -> Ident COLON type_expr 
## In state 52, spurious reduction of production nsepseq(field_decl,SEMI) -> field_decl 
## In state 51, spurious reduction of production sep_or_term_list(field_decl,SEMI) -> nsepseq(field_decl,SEMI) 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident Is Record Ident COLON Ident SEMI Ident COLON Ident SEMI With
##
## Ends in an error in state: 57.
##
## nsepseq(field_decl,SEMI) -> field_decl SEMI . nsepseq(field_decl,SEMI) [ RBRACKET End ]
## seq(__anonymous_0(field_decl,SEMI)) -> field_decl SEMI . seq(__anonymous_0(field_decl,SEMI)) [ RBRACKET End ]
##
## The known suffix of the stack is as follows:
## field_decl SEMI
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident Is Record Ident COLON Ident SEMI Ident COLON Ident VBAR
##
## Ends in an error in state: 56.
##
## nsepseq(field_decl,SEMI) -> field_decl . [ RBRACKET End ]
## nsepseq(field_decl,SEMI) -> field_decl . SEMI nsepseq(field_decl,SEMI) [ RBRACKET End ]
## seq(__anonymous_0(field_decl,SEMI)) -> field_decl . SEMI seq(__anonymous_0(field_decl,SEMI)) [ RBRACKET End ]
##
## The known suffix of the stack is as follows:
## field_decl
##
## 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).
## In state 15, spurious reduction of production core_type -> Ident 
## In state 29, spurious reduction of production cartesian -> core_type 
## In state 35, spurious reduction of production fun_type -> cartesian 
## In state 43, spurious reduction of production type_expr -> fun_type 
## In state 47, spurious reduction of production field_decl -> Ident COLON type_expr 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident Is Record Ident COLON Ident SEMI With
##
## Ends in an error in state: 53.
##
## nsepseq(field_decl,SEMI) -> field_decl SEMI . nsepseq(field_decl,SEMI) [ RBRACKET End ]
## nseq(__anonymous_0(field_decl,SEMI)) -> field_decl SEMI . seq(__anonymous_0(field_decl,SEMI)) [ RBRACKET End ]
##
## The known suffix of the stack is as follows:
## field_decl SEMI
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident Is Record Ident COLON Ident VBAR
##
## Ends in an error in state: 52.
##
## nsepseq(field_decl,SEMI) -> field_decl . [ RBRACKET End ]
## nsepseq(field_decl,SEMI) -> field_decl . SEMI nsepseq(field_decl,SEMI) [ RBRACKET End ]
## nseq(__anonymous_0(field_decl,SEMI)) -> field_decl . SEMI seq(__anonymous_0(field_decl,SEMI)) [ RBRACKET End ]
##
## The known suffix of the stack is as follows:
## field_decl
##
## 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).
## In state 15, spurious reduction of production core_type -> Ident 
## In state 29, spurious reduction of production cartesian -> core_type 
## In state 35, spurious reduction of production fun_type -> cartesian 
## In state 43, spurious reduction of production type_expr -> fun_type 
## In state 47, spurious reduction of production field_decl -> Ident COLON type_expr 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident Is Record Ident COLON With
##
## Ends in an error in state: 10.
##
## field_decl -> Ident COLON . type_expr [ SEMI RBRACKET End ]
##
## The known suffix of the stack is as follows:
## Ident COLON
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident Is Record Ident With
##
## Ends in an error in state: 9.
##
## field_decl -> Ident . COLON type_expr [ SEMI RBRACKET End ]
##
## The known suffix of the stack is as follows:
## Ident
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident Is Record LBRACKET Ident COLON Ident End
##
## Ends in an error in state: 48.
##
## record_type -> Record LBRACKET sep_or_term_list(field_decl,SEMI) . RBRACKET [ Type SEMI Recursive RPAR RBRACKET Is Function End EQ EOF Const COMMA Attributes ASS ]
##
## The known suffix of the stack is as follows:
## Record LBRACKET sep_or_term_list(field_decl,SEMI)
##
## 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).
## In state 15, spurious reduction of production core_type -> Ident 
## In state 29, spurious reduction of production cartesian -> core_type 
## In state 35, spurious reduction of production fun_type -> cartesian 
## In state 43, spurious reduction of production type_expr -> fun_type 
## In state 47, spurious reduction of production field_decl -> Ident COLON type_expr 
## In state 52, spurious reduction of production nsepseq(field_decl,SEMI) -> field_decl 
## In state 51, spurious reduction of production sep_or_term_list(field_decl,SEMI) -> nsepseq(field_decl,SEMI) 
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident Is Record LBRACKET With
##
## Ends in an error in state: 8.
##
## record_type -> Record LBRACKET . sep_or_term_list(field_decl,SEMI) RBRACKET [ Type SEMI Recursive RPAR RBRACKET Is Function End EQ EOF Const COMMA Attributes ASS ]
##
## The known suffix of the stack is as follows:
## Record LBRACKET
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident Is Record With
##
## Ends in an error in state: 7.
##
## record_type -> Record . sep_or_term_list(field_decl,SEMI) End [ Type SEMI Recursive RPAR RBRACKET Is Function End EQ EOF Const COMMA Attributes ASS ]
## record_type -> Record . LBRACKET sep_or_term_list(field_decl,SEMI) RBRACKET [ Type SEMI Recursive RPAR RBRACKET Is Function End EQ EOF Const COMMA Attributes ASS ]
##
## The known suffix of the stack is as follows:
## Record
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident Is Set With
##
## Ends in an error in state: 5.
##
## core_type -> Set . par(type_expr) [ VBAR Type TIMES SEMI Recursive RPAR RBRACKET Is Function End EQ EOF Const COMMA Attributes ASS ARROW ]
##
## The known suffix of the stack is as follows:
## Set
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident Is VBAR Const
##
## Ends in an error in state: 25.
##
## sum_type -> option(VBAR) . nsepseq(variant,VBAR) [ Type SEMI Recursive RPAR RBRACKET Is Function End EQ EOF Const COMMA Attributes ASS ]
##
## The known suffix of the stack is as follows:
## option(VBAR)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident Is With
##
## Ends in an error in state: 3.
##
## type_decl -> Type Ident Is . type_expr option(SEMI) [ Type Recursive Function EOF Const Attributes ]
##
## The known suffix of the stack is as follows:
## Type Ident Is
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident With
##
## Ends in an error in state: 2.
##
## type_decl -> Type Ident . Is type_expr option(SEMI) [ Type Recursive Function EOF Const Attributes ]
##
## The known suffix of the stack is as follows:
## Type Ident
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type With
##
## Ends in an error in state: 1.
##
## type_decl -> Type . Ident Is type_expr option(SEMI) [ Type Recursive Function EOF Const Attributes ]
##
## The known suffix of the stack is as follows:
## Type
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: With
##
## Ends in an error in state: 0.
##
## contract' -> . contract [ # ]
##
## The known suffix of the stack is as follows:
##
##

<YOUR SYNTAX ERROR MESSAGE HERE>

