interactive_expr: C_None WILD
##
## Ends in an error in state: 174.
##
## call_expr_level -> call_expr_level_in . option(type_annotation_simple) [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LE GT GE EQEQ EOF COMMA CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## call_expr_level_in
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: C_Some VBAR
##
## Ends in an error in state: 126.
##
## constr_expr -> C_Some . core_expr [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## C_Some
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Constr DOT Ident WILD
##
## Ends in an error in state: 112.
##
## module_fun -> Ident . [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LPAR LE LBRACE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
## projection -> Constr DOT Ident . selection [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LPAR LE LBRACE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## Constr DOT Ident
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Constr DOT WILD
##
## Ends in an error in state: 110.
##
## module_field -> Constr DOT . module_fun [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LPAR LE LBRACE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
## projection -> Constr DOT . Ident selection [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LPAR LE LBRACE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## Constr DOT
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Constr Switch
##
## Ends in an error in state: 109.
##
## constr_expr -> Constr . core_expr [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
## constr_expr -> Constr . [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
## module_field -> Constr . DOT module_fun [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LPAR LE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
## projection -> Constr . DOT Ident selection [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LPAR LE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## Constr
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Ident DOT Ident WILD
##
## Ends in an error in state: 104.
##
## selection -> DOT Ident . selection [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LPAR LE LBRACE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
## selection -> DOT Ident . [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LPAR LE LBRACE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## DOT Ident
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Ident DOT WILD
##
## Ends in an error in state: 103.
##
## selection -> DOT . Ident selection [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LPAR LE LBRACE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
## selection -> DOT . Ident [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LPAR LE LBRACE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## DOT
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Ident LBRACKET Int RBRACKET WILD
##
## Ends in an error in state: 102.
##
## selection -> LBRACKET Int RBRACKET . selection [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LPAR LE LBRACE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
## selection -> LBRACKET Int RBRACKET . [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LPAR LE LBRACE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## LBRACKET Int RBRACKET
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Ident LBRACKET Int WILD
##
## Ends in an error in state: 101.
##
## selection -> LBRACKET Int . RBRACKET selection [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LPAR LE LBRACE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
## selection -> LBRACKET Int . RBRACKET [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LPAR LE LBRACE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## LBRACKET Int
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Ident LBRACKET WILD
##
## Ends in an error in state: 100.
##
## selection -> LBRACKET . Int RBRACKET selection [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LPAR LE LBRACE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
## selection -> LBRACKET . Int RBRACKET [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LPAR LE LBRACE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## LBRACKET
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Ident WILD
##
## Ends in an error in state: 99.
##
## common_expr -> Ident . [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LPAR LE LBRACE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
## projection -> Ident . selection [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LPAR LE LBRACE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## Ident
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LBRACE VBAR
##
## Ends in an error in state: 228.
##
## parenthesized_expr -> LBRACE . expr RBRACE [ LBRACE ]
##
## The known suffix of the stack is as follows:
## LBRACE
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LBRACE WILD VBAR
##
## Ends in an error in state: 229.
##
## parenthesized_expr -> LBRACE expr . RBRACE [ LBRACE ]
##
## The known suffix of the stack is as follows:
## LBRACE 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 156, spurious reduction of production call_expr_level_in -> core_expr
## In state 174, spurious reduction of production option(type_annotation_simple) ->
## In state 175, spurious reduction of production call_expr_level -> call_expr_level_in option(type_annotation_simple)
## In state 176, spurious reduction of production unary_expr_level -> call_expr_level
## In state 129, spurious reduction of production mult_expr_level -> unary_expr_level
## In state 153, spurious reduction of production add_expr_level -> mult_expr_level
## In state 184, spurious reduction of production cat_expr_level -> add_expr_level
## In state 205, spurious reduction of production comp_expr_level -> cat_expr_level
## In state 212, spurious reduction of production conj_expr_level -> comp_expr_level
## In state 219, spurious reduction of production disj_expr_level -> conj_expr_level
## In state 166, spurious reduction of production base_expr -> disj_expr_level
## In state 223, spurious reduction of production base_cond -> base_expr
## In state 224, spurious reduction of production expr -> base_cond
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LPAR VBAR
##
## Ends in an error in state: 98.
##
## parenthesized_expr -> LPAR . expr RPAR [ LBRACE ]
##
## The known suffix of the stack is as follows:
## LPAR
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LPAR WILD RPAR LBRACE If LPAR Bytes RPAR LBRACE VBAR
##
## Ends in an error in state: 351.
##
## if_then_else(closed_if) -> If parenthesized_expr LBRACE . closed_if option(SEMI) RBRACE Else LBRACE closed_if option(SEMI) RBRACE [ SEMI RBRACE ]
##
## The known suffix of the stack is as follows:
## If parenthesized_expr LBRACE
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LPAR WILD RPAR LBRACE If LPAR Bytes RPAR LBRACE WILD RBRACE Else LBRACE VBAR
##
## Ends in an error in state: 411.
##
## if_then_else(closed_if) -> If parenthesized_expr LBRACE closed_if option(SEMI) RBRACE Else LBRACE . closed_if option(SEMI) RBRACE [ SEMI RBRACE ]
##
## The known suffix of the stack is as follows:
## If parenthesized_expr LBRACE closed_if option(SEMI) RBRACE Else LBRACE
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LPAR WILD RPAR LBRACE If LPAR Bytes RPAR LBRACE WILD RBRACE Else LBRACE WILD SEMI PLUS
##
## Ends in an error in state: 413.
##
## if_then_else(closed_if) -> If parenthesized_expr LBRACE closed_if option(SEMI) RBRACE Else LBRACE closed_if option(SEMI) . RBRACE [ SEMI RBRACE ]
##
## The known suffix of the stack is as follows:
## If parenthesized_expr LBRACE closed_if option(SEMI) RBRACE Else LBRACE closed_if option(SEMI)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LPAR WILD RPAR LBRACE If LPAR Bytes RPAR LBRACE WILD RBRACE Else LBRACE WILD VBAR
##
## Ends in an error in state: 412.
##
## if_then_else(closed_if) -> If parenthesized_expr LBRACE closed_if option(SEMI) RBRACE Else LBRACE closed_if . option(SEMI) RBRACE [ SEMI RBRACE ]
##
## The known suffix of the stack is as follows:
## If parenthesized_expr LBRACE closed_if option(SEMI) RBRACE Else LBRACE closed_if
##
## 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 156, spurious reduction of production call_expr_level_in -> core_expr
## In state 174, spurious reduction of production option(type_annotation_simple) ->
## In state 175, spurious reduction of production call_expr_level -> call_expr_level_in option(type_annotation_simple)
## In state 176, spurious reduction of production unary_expr_level -> call_expr_level
## In state 129, spurious reduction of production mult_expr_level -> unary_expr_level
## In state 153, spurious reduction of production add_expr_level -> mult_expr_level
## In state 184, spurious reduction of production cat_expr_level -> add_expr_level
## In state 205, spurious reduction of production comp_expr_level -> cat_expr_level
## In state 212, spurious reduction of production conj_expr_level -> comp_expr_level
## In state 219, spurious reduction of production disj_expr_level -> conj_expr_level
## In state 166, spurious reduction of production base_expr -> disj_expr_level
## In state 416, spurious reduction of production base_if_then_else__open(closed_if) -> base_expr
## In state 415, spurious reduction of production closed_if -> base_if_then_else__open(closed_if)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LPAR WILD RPAR LBRACE If LPAR Bytes RPAR LBRACE WILD RBRACE Else WILD
##
## Ends in an error in state: 410.
##
## if_then_else(closed_if) -> If parenthesized_expr LBRACE closed_if option(SEMI) RBRACE Else . LBRACE closed_if option(SEMI) RBRACE [ SEMI RBRACE ]
##
## The known suffix of the stack is as follows:
## If parenthesized_expr LBRACE closed_if option(SEMI) RBRACE Else
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LPAR WILD RPAR LBRACE If LPAR Bytes RPAR LBRACE WILD RBRACE WILD
##
## Ends in an error in state: 409.
##
## if_then_else(closed_if) -> If parenthesized_expr LBRACE closed_if option(SEMI) RBRACE . Else LBRACE closed_if option(SEMI) RBRACE [ SEMI RBRACE ]
##
## The known suffix of the stack is as follows:
## If parenthesized_expr LBRACE closed_if option(SEMI) RBRACE
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LPAR WILD RPAR LBRACE If LPAR Bytes RPAR LBRACE WILD SEMI PLUS
##
## Ends in an error in state: 408.
##
## if_then_else(closed_if) -> If parenthesized_expr LBRACE closed_if option(SEMI) . RBRACE Else LBRACE closed_if option(SEMI) RBRACE [ SEMI RBRACE ]
##
## The known suffix of the stack is as follows:
## If parenthesized_expr LBRACE closed_if option(SEMI)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LPAR WILD RPAR LBRACE If LPAR Bytes RPAR LBRACE WILD VBAR
##
## Ends in an error in state: 407.
##
## if_then_else(closed_if) -> If parenthesized_expr LBRACE closed_if . option(SEMI) RBRACE Else LBRACE closed_if option(SEMI) RBRACE [ SEMI RBRACE ]
##
## The known suffix of the stack is as follows:
## If parenthesized_expr LBRACE closed_if
##
## 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 156, spurious reduction of production call_expr_level_in -> core_expr
## In state 174, spurious reduction of production option(type_annotation_simple) ->
## In state 175, spurious reduction of production call_expr_level -> call_expr_level_in option(type_annotation_simple)
## In state 176, spurious reduction of production unary_expr_level -> call_expr_level
## In state 129, spurious reduction of production mult_expr_level -> unary_expr_level
## In state 153, spurious reduction of production add_expr_level -> mult_expr_level
## In state 184, spurious reduction of production cat_expr_level -> add_expr_level
## In state 205, spurious reduction of production comp_expr_level -> cat_expr_level
## In state 212, spurious reduction of production conj_expr_level -> comp_expr_level
## In state 219, spurious reduction of production disj_expr_level -> conj_expr_level
## In state 166, spurious reduction of production base_expr -> disj_expr_level
## In state 416, spurious reduction of production base_if_then_else__open(closed_if) -> base_expr
## In state 415, spurious reduction of production closed_if -> base_if_then_else__open(closed_if)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LPAR WILD RPAR LBRACE If LPAR Bytes RPAR WILD
##
## Ends in an error in state: 350.
##
## if_then_else(closed_if) -> If parenthesized_expr . LBRACE closed_if option(SEMI) RBRACE Else LBRACE closed_if option(SEMI) RBRACE [ SEMI RBRACE ]
##
## The known suffix of the stack is as follows:
## If parenthesized_expr
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LPAR WILD RPAR LBRACE If WILD
##
## Ends in an error in state: 349.
##
## if_then_else(closed_if) -> If . parenthesized_expr LBRACE closed_if option(SEMI) RBRACE Else LBRACE closed_if option(SEMI) RBRACE [ SEMI RBRACE ]
##
## The known suffix of the stack is as follows:
## If
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LPAR WILD RPAR LBRACE Switch VBAR
##
## Ends in an error in state: 233.
##
## switch_expr(base_if_then_else) -> Switch . switch_expr_ LBRACE cases(base_if_then_else) RBRACE [ SEMI RBRACE ]
##
## The known suffix of the stack is as follows:
## Switch
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LPAR WILD RPAR LBRACE Switch WILD LBRACE VBAR VBAR
##
## Ends in an error in state: 276.
##
## case_clause(base_if_then_else) -> VBAR . pattern ARROW base_if_then_else option(SEMI) [ VBAR RBRACE ]
##
## The known suffix of the stack is as follows:
## VBAR
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LPAR WILD RPAR LBRACE Switch WILD LBRACE VBAR WILD ARROW Bytes SEMI WILD
##
## Ends in an error in state: 434.
##
## nseq(case_clause(base_if_then_else)) -> case_clause(base_if_then_else) . seq(case_clause(base_if_then_else)) [ RBRACE ]
##
## The known suffix of the stack is as follows:
## case_clause(base_if_then_else)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LPAR WILD RPAR LBRACE Switch WILD LBRACE VBAR WILD ARROW Bytes VBAR Bytes ARROW Bytes SEMI WILD
##
## Ends in an error in state: 436.
##
## seq(case_clause(base_if_then_else)) -> case_clause(base_if_then_else) . seq(case_clause(base_if_then_else)) [ RBRACE ]
##
## The known suffix of the stack is as follows:
## case_clause(base_if_then_else)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LPAR WILD RPAR LBRACE Switch WILD LBRACE VBAR WILD ARROW If LPAR Bytes RPAR LBRACE VBAR
##
## Ends in an error in state: 348.
##
## if_then_else(base_if_then_else) -> If parenthesized_expr LBRACE . closed_if option(SEMI) RBRACE Else LBRACE base_if_then_else option(SEMI) RBRACE [ VBAR SEMI RBRACE ]
##
## The known suffix of the stack is as follows:
## If parenthesized_expr LBRACE
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LPAR WILD RPAR LBRACE Switch WILD LBRACE VBAR WILD ARROW If LPAR Bytes RPAR LBRACE WILD RBRACE Else LBRACE VBAR
##
## Ends in an error in state: 421.
##
## if_then_else(base_if_then_else) -> If parenthesized_expr LBRACE closed_if option(SEMI) RBRACE Else LBRACE . base_if_then_else option(SEMI) RBRACE [ VBAR SEMI RBRACE ]
##
## The known suffix of the stack is as follows:
## If parenthesized_expr LBRACE closed_if option(SEMI) RBRACE Else LBRACE
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LPAR WILD RPAR LBRACE Switch WILD LBRACE VBAR WILD ARROW If LPAR Bytes RPAR LBRACE WILD RBRACE Else LBRACE WILD SEMI PLUS
##
## Ends in an error in state: 425.
##
## if_then_else(base_if_then_else) -> If parenthesized_expr LBRACE closed_if option(SEMI) RBRACE Else LBRACE base_if_then_else option(SEMI) . RBRACE [ VBAR SEMI RBRACE ]
##
## The known suffix of the stack is as follows:
## If parenthesized_expr LBRACE closed_if option(SEMI) RBRACE Else LBRACE base_if_then_else option(SEMI)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LPAR WILD RPAR LBRACE Switch WILD LBRACE VBAR WILD ARROW If LPAR Bytes RPAR LBRACE WILD RBRACE Else LBRACE WILD VBAR
##
## Ends in an error in state: 424.
##
## if_then_else(base_if_then_else) -> If parenthesized_expr LBRACE closed_if option(SEMI) RBRACE Else LBRACE base_if_then_else . option(SEMI) RBRACE [ VBAR SEMI RBRACE ]
##
## The known suffix of the stack is as follows:
## If parenthesized_expr LBRACE closed_if option(SEMI) RBRACE Else LBRACE base_if_then_else
##
## 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 156, spurious reduction of production call_expr_level_in -> core_expr
## In state 174, spurious reduction of production option(type_annotation_simple) ->
## In state 175, spurious reduction of production call_expr_level -> call_expr_level_in option(type_annotation_simple)
## In state 176, spurious reduction of production unary_expr_level -> call_expr_level
## In state 129, spurious reduction of production mult_expr_level -> unary_expr_level
## In state 153, spurious reduction of production add_expr_level -> mult_expr_level
## In state 184, spurious reduction of production cat_expr_level -> add_expr_level
## In state 205, spurious reduction of production comp_expr_level -> cat_expr_level
## In state 212, spurious reduction of production conj_expr_level -> comp_expr_level
## In state 219, spurious reduction of production disj_expr_level -> conj_expr_level
## In state 166, spurious reduction of production base_expr -> disj_expr_level
## In state 427, spurious reduction of production base_if_then_else__open(base_if_then_else) -> base_expr
## In state 423, spurious reduction of production base_if_then_else -> base_if_then_else__open(base_if_then_else)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LPAR WILD RPAR LBRACE Switch WILD LBRACE VBAR WILD ARROW If LPAR Bytes RPAR LBRACE WILD RBRACE Else WILD
##
## Ends in an error in state: 420.
##
## if_then_else(base_if_then_else) -> If parenthesized_expr LBRACE closed_if option(SEMI) RBRACE Else . LBRACE base_if_then_else option(SEMI) RBRACE [ VBAR SEMI RBRACE ]
##
## The known suffix of the stack is as follows:
## If parenthesized_expr LBRACE closed_if option(SEMI) RBRACE Else
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LPAR WILD RPAR LBRACE Switch WILD LBRACE VBAR WILD ARROW If LPAR Bytes RPAR LBRACE WILD RBRACE WILD
##
## Ends in an error in state: 419.
##
## if_then_else(base_if_then_else) -> If parenthesized_expr LBRACE closed_if option(SEMI) RBRACE . Else LBRACE base_if_then_else option(SEMI) RBRACE [ VBAR SEMI RBRACE ]
##
## The known suffix of the stack is as follows:
## If parenthesized_expr LBRACE closed_if option(SEMI) RBRACE
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LPAR WILD RPAR LBRACE Switch WILD LBRACE VBAR WILD ARROW If LPAR Bytes RPAR LBRACE WILD SEMI PLUS
##
## Ends in an error in state: 418.
##
## if_then_else(base_if_then_else) -> If parenthesized_expr LBRACE closed_if option(SEMI) . RBRACE Else LBRACE base_if_then_else option(SEMI) RBRACE [ VBAR SEMI RBRACE ]
##
## The known suffix of the stack is as follows:
## If parenthesized_expr LBRACE closed_if option(SEMI)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LPAR WILD RPAR LBRACE Switch WILD LBRACE VBAR WILD ARROW If LPAR Bytes RPAR LBRACE WILD VBAR
##
## Ends in an error in state: 417.
##
## if_then_else(base_if_then_else) -> If parenthesized_expr LBRACE closed_if . option(SEMI) RBRACE Else LBRACE base_if_then_else option(SEMI) RBRACE [ VBAR SEMI RBRACE ]
##
## The known suffix of the stack is as follows:
## If parenthesized_expr LBRACE closed_if
##
## 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 156, spurious reduction of production call_expr_level_in -> core_expr
## In state 174, spurious reduction of production option(type_annotation_simple) ->
## In state 175, spurious reduction of production call_expr_level -> call_expr_level_in option(type_annotation_simple)
## In state 176, spurious reduction of production unary_expr_level -> call_expr_level
## In state 129, spurious reduction of production mult_expr_level -> unary_expr_level
## In state 153, spurious reduction of production add_expr_level -> mult_expr_level
## In state 184, spurious reduction of production cat_expr_level -> add_expr_level
## In state 205, spurious reduction of production comp_expr_level -> cat_expr_level
## In state 212, spurious reduction of production conj_expr_level -> comp_expr_level
## In state 219, spurious reduction of production disj_expr_level -> conj_expr_level
## In state 166, spurious reduction of production base_expr -> disj_expr_level
## In state 416, spurious reduction of production base_if_then_else__open(closed_if) -> base_expr
## In state 415, spurious reduction of production closed_if -> base_if_then_else__open(closed_if)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LPAR WILD RPAR LBRACE Switch WILD LBRACE VBAR WILD ARROW If LPAR Bytes RPAR WILD
##
## Ends in an error in state: 347.
##
## if_then_else(base_if_then_else) -> If parenthesized_expr . LBRACE closed_if option(SEMI) RBRACE Else LBRACE base_if_then_else option(SEMI) RBRACE [ VBAR SEMI RBRACE ]
##
## The known suffix of the stack is as follows:
## If parenthesized_expr
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LPAR WILD RPAR LBRACE Switch WILD LBRACE VBAR WILD ARROW If WILD
##
## Ends in an error in state: 346.
##
## if_then_else(base_if_then_else) -> If . parenthesized_expr LBRACE closed_if option(SEMI) RBRACE Else LBRACE base_if_then_else option(SEMI) RBRACE [ VBAR SEMI RBRACE ]
##
## The known suffix of the stack is as follows:
## If
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LPAR WILD RPAR LBRACE Switch WILD LBRACE VBAR WILD ARROW VBAR
##
## Ends in an error in state: 345.
##
## case_clause(base_if_then_else) -> VBAR pattern ARROW . base_if_then_else option(SEMI) [ VBAR RBRACE ]
##
## The known suffix of the stack is as follows:
## VBAR pattern ARROW
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LPAR WILD RPAR LBRACE Switch WILD LBRACE VBAR WILD ARROW WILD Type
##
## Ends in an error in state: 428.
##
## case_clause(base_if_then_else) -> VBAR pattern ARROW base_if_then_else . option(SEMI) [ VBAR RBRACE ]
##
## The known suffix of the stack is as follows:
## VBAR pattern ARROW base_if_then_else
##
## 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 156, spurious reduction of production call_expr_level_in -> core_expr
## In state 174, spurious reduction of production option(type_annotation_simple) ->
## In state 175, spurious reduction of production call_expr_level -> call_expr_level_in option(type_annotation_simple)
## In state 176, spurious reduction of production unary_expr_level -> call_expr_level
## In state 129, spurious reduction of production mult_expr_level -> unary_expr_level
## In state 153, spurious reduction of production add_expr_level -> mult_expr_level
## In state 184, spurious reduction of production cat_expr_level -> add_expr_level
## In state 205, spurious reduction of production comp_expr_level -> cat_expr_level
## In state 212, spurious reduction of production conj_expr_level -> comp_expr_level
## In state 219, spurious reduction of production disj_expr_level -> conj_expr_level
## In state 166, spurious reduction of production base_expr -> disj_expr_level
## In state 427, spurious reduction of production base_if_then_else__open(base_if_then_else) -> base_expr
## In state 423, spurious reduction of production base_if_then_else -> base_if_then_else__open(base_if_then_else)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LPAR WILD RPAR LBRACE Switch WILD LBRACE VBAR WILD COMMA Bytes RPAR
##
## Ends in an error in state: 344.
##
## case_clause(base_if_then_else) -> VBAR pattern . ARROW base_if_then_else option(SEMI) [ VBAR RBRACE ]
##
## The known suffix of the stack is as follows:
## VBAR 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 330, spurious reduction of production nsepseq(sub_pattern,COMMA) -> sub_pattern
## In state 333, spurious reduction of production tuple(sub_pattern) -> sub_pattern COMMA nsepseq(sub_pattern,COMMA)
## In state 342, spurious reduction of production pattern -> tuple(sub_pattern)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LPAR WILD RPAR LBRACE Switch WILD LBRACE WILD
##
## Ends in an error in state: 275.
##
## switch_expr(base_if_then_else) -> Switch switch_expr_ LBRACE . cases(base_if_then_else) RBRACE [ SEMI RBRACE ]
##
## The known suffix of the stack is as follows:
## Switch switch_expr_ LBRACE
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LPAR WILD RPAR LBRACE Switch WILD WILD
##
## Ends in an error in state: 274.
##
## switch_expr(base_if_then_else) -> Switch switch_expr_ . LBRACE cases(base_if_then_else) RBRACE [ SEMI RBRACE ]
##
## The known suffix of the stack is as follows:
## Switch switch_expr_
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LPAR WILD RPAR LBRACE VBAR
##
## Ends in an error in state: 232.
##
## if_then(expr_with_let_expr) -> If parenthesized_expr LBRACE . closed_if option(SEMI) RBRACE [ VBAR Type SEMI RPAR RBRACKET RBRACE Let EOF COMMA Attr ]
## if_then_else(expr_with_let_expr) -> If parenthesized_expr LBRACE . closed_if option(SEMI) RBRACE Else LBRACE expr_with_let_expr option(SEMI) RBRACE [ VBAR Type SEMI RPAR RBRACKET RBRACE Let EOF COMMA Attr ]
##
## The known suffix of the stack is as follows:
## If parenthesized_expr LBRACE
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LPAR WILD RPAR LBRACE WILD RBRACE Else LBRACE VBAR
##
## Ends in an error in state: 446.
##
## if_then_else(expr_with_let_expr) -> If parenthesized_expr LBRACE closed_if option(SEMI) RBRACE Else LBRACE . expr_with_let_expr option(SEMI) RBRACE [ VBAR Type SEMI RPAR RBRACKET RBRACE Let EOF COMMA Attr ]
##
## The known suffix of the stack is as follows:
## If parenthesized_expr LBRACE closed_if option(SEMI) RBRACE Else LBRACE
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LPAR WILD RPAR LBRACE WILD RBRACE Else LBRACE WILD SEMI PLUS
##
## Ends in an error in state: 448.
##
## if_then_else(expr_with_let_expr) -> If parenthesized_expr LBRACE closed_if option(SEMI) RBRACE Else LBRACE expr_with_let_expr option(SEMI) . RBRACE [ VBAR Type SEMI RPAR RBRACKET RBRACE Let EOF COMMA Attr ]
##
## The known suffix of the stack is as follows:
## If parenthesized_expr LBRACE closed_if option(SEMI) RBRACE Else LBRACE expr_with_let_expr option(SEMI)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LPAR WILD RPAR LBRACE WILD RBRACE Else LBRACE WILD VBAR
##
## Ends in an error in state: 447.
##
## if_then_else(expr_with_let_expr) -> If parenthesized_expr LBRACE closed_if option(SEMI) RBRACE Else LBRACE expr_with_let_expr . option(SEMI) RBRACE [ VBAR Type SEMI RPAR RBRACKET RBRACE Let EOF COMMA Attr ]
##
## The known suffix of the stack is as follows:
## If parenthesized_expr LBRACE closed_if option(SEMI) RBRACE Else LBRACE expr_with_let_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 156, spurious reduction of production call_expr_level_in -> core_expr
## In state 174, spurious reduction of production option(type_annotation_simple) ->
## In state 175, spurious reduction of production call_expr_level -> call_expr_level_in option(type_annotation_simple)
## In state 176, spurious reduction of production unary_expr_level -> call_expr_level
## In state 129, spurious reduction of production mult_expr_level -> unary_expr_level
## In state 153, spurious reduction of production add_expr_level -> mult_expr_level
## In state 184, spurious reduction of production cat_expr_level -> add_expr_level
## In state 205, spurious reduction of production comp_expr_level -> cat_expr_level
## In state 212, spurious reduction of production conj_expr_level -> comp_expr_level
## In state 219, spurious reduction of production disj_expr_level -> conj_expr_level
## In state 166, spurious reduction of production base_expr -> disj_expr_level
## In state 223, spurious reduction of production base_cond -> base_expr
## In state 224, spurious reduction of production expr -> base_cond
## In state 401, spurious reduction of production expr_with_let_expr -> expr
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LPAR WILD RPAR LBRACE WILD RBRACE Else WILD
##
## Ends in an error in state: 445.
##
## if_then_else(expr_with_let_expr) -> If parenthesized_expr LBRACE closed_if option(SEMI) RBRACE Else . LBRACE expr_with_let_expr option(SEMI) RBRACE [ VBAR Type SEMI RPAR RBRACKET RBRACE Let EOF COMMA Attr ]
##
## The known suffix of the stack is as follows:
## If parenthesized_expr LBRACE closed_if option(SEMI) RBRACE Else
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LPAR WILD RPAR LBRACE WILD RBRACE WILD
##
## Ends in an error in state: 444.
##
## if_then(expr_with_let_expr) -> If parenthesized_expr LBRACE closed_if option(SEMI) RBRACE . [ VBAR Type SEMI RPAR RBRACKET RBRACE Let EOF COMMA Attr ]
## if_then_else(expr_with_let_expr) -> If parenthesized_expr LBRACE closed_if option(SEMI) RBRACE . Else LBRACE expr_with_let_expr option(SEMI) RBRACE [ VBAR Type SEMI RPAR RBRACKET RBRACE Let EOF COMMA Attr ]
##
## The known suffix of the stack is as follows:
## If parenthesized_expr LBRACE closed_if option(SEMI) RBRACE
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LPAR WILD RPAR LBRACE WILD SEMI PLUS
##
## Ends in an error in state: 443.
##
## if_then(expr_with_let_expr) -> If parenthesized_expr LBRACE closed_if option(SEMI) . RBRACE [ VBAR Type SEMI RPAR RBRACKET RBRACE Let EOF COMMA Attr ]
## if_then_else(expr_with_let_expr) -> If parenthesized_expr LBRACE closed_if option(SEMI) . RBRACE Else LBRACE expr_with_let_expr option(SEMI) RBRACE [ VBAR Type SEMI RPAR RBRACKET RBRACE Let EOF COMMA Attr ]
##
## The known suffix of the stack is as follows:
## If parenthesized_expr LBRACE closed_if option(SEMI)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LPAR WILD RPAR LBRACE WILD VBAR
##
## Ends in an error in state: 442.
##
## if_then(expr_with_let_expr) -> If parenthesized_expr LBRACE closed_if . option(SEMI) RBRACE [ VBAR Type SEMI RPAR RBRACKET RBRACE Let EOF COMMA Attr ]
## if_then_else(expr_with_let_expr) -> If parenthesized_expr LBRACE closed_if . option(SEMI) RBRACE Else LBRACE expr_with_let_expr option(SEMI) RBRACE [ VBAR Type SEMI RPAR RBRACKET RBRACE Let EOF COMMA Attr ]
##
## The known suffix of the stack is as follows:
## If parenthesized_expr LBRACE closed_if
##
## 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 156, spurious reduction of production call_expr_level_in -> core_expr
## In state 174, spurious reduction of production option(type_annotation_simple) ->
## In state 175, spurious reduction of production call_expr_level -> call_expr_level_in option(type_annotation_simple)
## In state 176, spurious reduction of production unary_expr_level -> call_expr_level
## In state 129, spurious reduction of production mult_expr_level -> unary_expr_level
## In state 153, spurious reduction of production add_expr_level -> mult_expr_level
## In state 184, spurious reduction of production cat_expr_level -> add_expr_level
## In state 205, spurious reduction of production comp_expr_level -> cat_expr_level
## In state 212, spurious reduction of production conj_expr_level -> comp_expr_level
## In state 219, spurious reduction of production disj_expr_level -> conj_expr_level
## In state 166, spurious reduction of production base_expr -> disj_expr_level
## In state 416, spurious reduction of production base_if_then_else__open(closed_if) -> base_expr
## In state 415, spurious reduction of production closed_if -> base_if_then_else__open(closed_if)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LPAR WILD RPAR WILD
##
## Ends in an error in state: 231.
##
## if_then(expr_with_let_expr) -> If parenthesized_expr . LBRACE closed_if option(SEMI) RBRACE [ VBAR Type SEMI RPAR RBRACKET RBRACE Let EOF COMMA Attr ]
## if_then_else(expr_with_let_expr) -> If parenthesized_expr . LBRACE closed_if option(SEMI) RBRACE Else LBRACE expr_with_let_expr option(SEMI) RBRACE [ VBAR Type SEMI RPAR RBRACKET RBRACE Let EOF COMMA Attr ]
##
## The known suffix of the stack is as follows:
## If parenthesized_expr
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If LPAR WILD VBAR
##
## Ends in an error in state: 226.
##
## parenthesized_expr -> LPAR expr . RPAR [ LBRACE ]
##
## 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 156, spurious reduction of production call_expr_level_in -> core_expr
## In state 174, spurious reduction of production option(type_annotation_simple) ->
## In state 175, spurious reduction of production call_expr_level -> call_expr_level_in option(type_annotation_simple)
## In state 176, spurious reduction of production unary_expr_level -> call_expr_level
## In state 129, spurious reduction of production mult_expr_level -> unary_expr_level
## In state 153, spurious reduction of production add_expr_level -> mult_expr_level
## In state 184, spurious reduction of production cat_expr_level -> add_expr_level
## In state 205, spurious reduction of production comp_expr_level -> cat_expr_level
## In state 212, spurious reduction of production conj_expr_level -> comp_expr_level
## In state 219, spurious reduction of production disj_expr_level -> conj_expr_level
## In state 166, spurious reduction of production base_expr -> disj_expr_level
## In state 223, spurious reduction of production base_cond -> base_expr
## In state 224, spurious reduction of production expr -> base_cond
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: If WILD
##
## Ends in an error in state: 97.
##
## if_then(expr_with_let_expr) -> If . parenthesized_expr LBRACE closed_if option(SEMI) RBRACE [ VBAR Type SEMI RPAR RBRACKET RBRACE Let EOF COMMA Attr ]
## if_then_else(expr_with_let_expr) -> If . parenthesized_expr LBRACE closed_if option(SEMI) RBRACE Else LBRACE expr_with_let_expr option(SEMI) RBRACE [ VBAR Type SEMI RPAR RBRACKET RBRACE Let EOF COMMA Attr ]
##
## The known suffix of the stack is as follows:
## If
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LBRACE ELLIPSIS Constr DOT Ident WILD
##
## Ends in an error in state: 252.
##
## projection -> Constr DOT Ident . selection [ COMMA ]
##
## The known suffix of the stack is as follows:
## Constr DOT Ident
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LBRACE ELLIPSIS Constr DOT WILD
##
## Ends in an error in state: 251.
##
## projection -> Constr DOT . Ident selection [ COMMA ]
##
## The known suffix of the stack is as follows:
## Constr DOT
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LBRACE ELLIPSIS Constr WILD
##
## Ends in an error in state: 250.
##
## projection -> Constr . DOT Ident selection [ COMMA ]
##
## The known suffix of the stack is as follows:
## Constr
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LBRACE ELLIPSIS Ident COMMA Ident COLON Bytes VBAR
##
## Ends in an error in state: 267.
##
## nsepseq(field_path_assignment,COMMA) -> field_path_assignment . [ RBRACE ]
## nsepseq(field_path_assignment,COMMA) -> field_path_assignment . COMMA nsepseq(field_path_assignment,COMMA) [ RBRACE ]
## nseq(__anonymous_0(field_path_assignment,COMMA)) -> field_path_assignment . COMMA seq(__anonymous_0(field_path_assignment,COMMA)) [ RBRACE ]
##
## 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 156, spurious reduction of production call_expr_level_in -> core_expr
## In state 174, spurious reduction of production option(type_annotation_simple) ->
## In state 175, spurious reduction of production call_expr_level -> call_expr_level_in option(type_annotation_simple)
## In state 176, spurious reduction of production unary_expr_level -> call_expr_level
## In state 129, spurious reduction of production mult_expr_level -> unary_expr_level
## In state 153, spurious reduction of production add_expr_level -> mult_expr_level
## In state 184, spurious reduction of production cat_expr_level -> add_expr_level
## In state 205, spurious reduction of production comp_expr_level -> cat_expr_level
## In state 212, spurious reduction of production conj_expr_level -> comp_expr_level
## In state 219, spurious reduction of production disj_expr_level -> conj_expr_level
## In state 166, spurious reduction of production base_expr -> disj_expr_level
## In state 223, spurious reduction of production base_cond -> base_expr
## In state 224, spurious reduction of production expr -> base_cond
## In state 266, spurious reduction of production field_path_assignment -> nsepseq(field_name,DOT) COLON expr
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LBRACE ELLIPSIS Ident COMMA Ident COLON VBAR
##
## Ends in an error in state: 265.
##
## field_path_assignment -> nsepseq(field_name,DOT) COLON . expr [ RBRACE COMMA ]
##
## The known suffix of the stack is as follows:
## nsepseq(field_name,DOT) COLON
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LBRACE ELLIPSIS Ident COMMA Ident COMMA Ident COLON Bytes VBAR
##
## Ends in an error in state: 271.
##
## nsepseq(field_path_assignment,COMMA) -> field_path_assignment . [ RBRACE ]
## nsepseq(field_path_assignment,COMMA) -> field_path_assignment . COMMA nsepseq(field_path_assignment,COMMA) [ RBRACE ]
## seq(__anonymous_0(field_path_assignment,COMMA)) -> field_path_assignment . COMMA seq(__anonymous_0(field_path_assignment,COMMA)) [ RBRACE ]
##
## 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 156, spurious reduction of production call_expr_level_in -> core_expr
## In state 174, spurious reduction of production option(type_annotation_simple) ->
## In state 175, spurious reduction of production call_expr_level -> call_expr_level_in option(type_annotation_simple)
## In state 176, spurious reduction of production unary_expr_level -> call_expr_level
## In state 129, spurious reduction of production mult_expr_level -> unary_expr_level
## In state 153, spurious reduction of production add_expr_level -> mult_expr_level
## In state 184, spurious reduction of production cat_expr_level -> add_expr_level
## In state 205, spurious reduction of production comp_expr_level -> cat_expr_level
## In state 212, spurious reduction of production conj_expr_level -> comp_expr_level
## In state 219, spurious reduction of production disj_expr_level -> conj_expr_level
## In state 166, spurious reduction of production base_expr -> disj_expr_level
## In state 223, spurious reduction of production base_cond -> base_expr
## In state 224, spurious reduction of production expr -> base_cond
## In state 266, spurious reduction of production field_path_assignment -> nsepseq(field_name,DOT) COLON expr
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LBRACE ELLIPSIS Ident COMMA Ident COMMA Ident COMMA WILD
##
## Ends in an error in state: 272.
##
## nsepseq(field_path_assignment,COMMA) -> field_path_assignment COMMA . nsepseq(field_path_assignment,COMMA) [ RBRACE ]
## seq(__anonymous_0(field_path_assignment,COMMA)) -> field_path_assignment COMMA . seq(__anonymous_0(field_path_assignment,COMMA)) [ RBRACE ]
##
## The known suffix of the stack is as follows:
## field_path_assignment COMMA
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LBRACE ELLIPSIS Ident COMMA Ident COMMA WILD
##
## Ends in an error in state: 268.
##
## nsepseq(field_path_assignment,COMMA) -> field_path_assignment COMMA . nsepseq(field_path_assignment,COMMA) [ RBRACE ]
## nseq(__anonymous_0(field_path_assignment,COMMA)) -> field_path_assignment COMMA . seq(__anonymous_0(field_path_assignment,COMMA)) [ RBRACE ]
##
## The known suffix of the stack is as follows:
## field_path_assignment COMMA
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LBRACE ELLIPSIS Ident COMMA Ident DOT Ident WILD
##
## Ends in an error in state: 258.
##
## nsepseq(field_name,DOT) -> Ident . [ COLON ]
## nsepseq(field_name,DOT) -> Ident . DOT nsepseq(field_name,DOT) [ COLON ]
##
## The known suffix of the stack is as follows:
## Ident
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LBRACE ELLIPSIS Ident COMMA Ident DOT WILD
##
## Ends in an error in state: 257.
##
## nsepseq(field_name,DOT) -> Ident DOT . nsepseq(field_name,DOT) [ COLON ]
##
## The known suffix of the stack is as follows:
## Ident DOT
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LBRACE ELLIPSIS Ident COMMA Ident WILD
##
## Ends in an error in state: 256.
##
## field_path_assignment -> Ident . [ RBRACE COMMA ]
## nsepseq(field_name,DOT) -> Ident . [ COLON ]
## nsepseq(field_name,DOT) -> Ident . DOT nsepseq(field_name,DOT) [ COLON ]
##
## The known suffix of the stack is as follows:
## Ident
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LBRACE ELLIPSIS Ident COMMA WILD
##
## Ends in an error in state: 255.
##
## update_record -> LBRACE ELLIPSIS path COMMA . sep_or_term_list(field_path_assignment,COMMA) RBRACE [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LPAR LE LBRACE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## LBRACE ELLIPSIS path COMMA
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LBRACE ELLIPSIS Ident DOT Ident VBAR
##
## Ends in an error in state: 254.
##
## update_record -> LBRACE ELLIPSIS path . COMMA sep_or_term_list(field_path_assignment,COMMA) RBRACE [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LPAR LE LBRACE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## LBRACE ELLIPSIS 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 104, spurious reduction of production selection -> DOT Ident
## In state 107, spurious reduction of production projection -> Ident selection
## In state 253, spurious reduction of production path -> projection
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LBRACE ELLIPSIS Ident WILD
##
## Ends in an error in state: 249.
##
## path -> Ident . [ COMMA ]
## projection -> Ident . selection [ COMMA ]
##
## The known suffix of the stack is as follows:
## Ident
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LBRACE ELLIPSIS WILD
##
## Ends in an error in state: 248.
##
## update_record -> LBRACE ELLIPSIS . path COMMA sep_or_term_list(field_path_assignment,COMMA) RBRACE [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LPAR LE LBRACE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## LBRACE ELLIPSIS
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LBRACE Ident COLON Bytes VBAR
##
## Ends in an error in state: 482.
##
## sequence_or_record_in -> field_assignment . option(more_field_assignments) [ RBRACE ]
##
## 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 156, spurious reduction of production call_expr_level_in -> core_expr
## In state 174, spurious reduction of production option(type_annotation_simple) ->
## In state 175, spurious reduction of production call_expr_level -> call_expr_level_in option(type_annotation_simple)
## In state 176, spurious reduction of production unary_expr_level -> call_expr_level
## In state 129, spurious reduction of production mult_expr_level -> unary_expr_level
## In state 153, spurious reduction of production add_expr_level -> mult_expr_level
## In state 184, spurious reduction of production cat_expr_level -> add_expr_level
## In state 205, spurious reduction of production comp_expr_level -> cat_expr_level
## In state 212, spurious reduction of production conj_expr_level -> comp_expr_level
## In state 219, spurious reduction of production disj_expr_level -> conj_expr_level
## In state 166, spurious reduction of production base_expr -> disj_expr_level
## In state 223, spurious reduction of production base_cond -> base_expr
## In state 224, spurious reduction of production expr -> base_cond
## In state 464, spurious reduction of production field_assignment -> Ident COLON expr
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LBRACE Ident COLON VBAR
##
## Ends in an error in state: 463.
##
## field_assignment -> Ident COLON . expr [ RBRACE COMMA ]
##
## The known suffix of the stack is as follows:
## Ident COLON
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LBRACE Ident COMMA Ident COLON Bytes VBAR
##
## Ends in an error in state: 468.
##
## nsepseq(field_assignment_punning,COMMA) -> field_assignment_punning . [ RBRACE ]
## nsepseq(field_assignment_punning,COMMA) -> field_assignment_punning . COMMA nsepseq(field_assignment_punning,COMMA) [ RBRACE ]
## nseq(__anonymous_0(field_assignment_punning,COMMA)) -> field_assignment_punning . COMMA seq(__anonymous_0(field_assignment_punning,COMMA)) [ RBRACE ]
##
## The known suffix of the stack is as follows:
## field_assignment_punning
##
## 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 156, spurious reduction of production call_expr_level_in -> core_expr
## In state 174, spurious reduction of production option(type_annotation_simple) ->
## In state 175, spurious reduction of production call_expr_level -> call_expr_level_in option(type_annotation_simple)
## In state 176, spurious reduction of production unary_expr_level -> call_expr_level
## In state 129, spurious reduction of production mult_expr_level -> unary_expr_level
## In state 153, spurious reduction of production add_expr_level -> mult_expr_level
## In state 184, spurious reduction of production cat_expr_level -> add_expr_level
## In state 205, spurious reduction of production comp_expr_level -> cat_expr_level
## In state 212, spurious reduction of production conj_expr_level -> comp_expr_level
## In state 219, spurious reduction of production disj_expr_level -> conj_expr_level
## In state 166, spurious reduction of production base_expr -> disj_expr_level
## In state 223, spurious reduction of production base_cond -> base_expr
## In state 224, spurious reduction of production expr -> base_cond
## In state 464, spurious reduction of production field_assignment -> Ident COLON expr
## In state 475, spurious reduction of production field_assignment_punning -> field_assignment
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LBRACE Ident COMMA Ident COMMA Ident COLON Bytes VBAR
##
## Ends in an error in state: 472.
##
## nsepseq(field_assignment_punning,COMMA) -> field_assignment_punning . [ RBRACE ]
## nsepseq(field_assignment_punning,COMMA) -> field_assignment_punning . COMMA nsepseq(field_assignment_punning,COMMA) [ RBRACE ]
## seq(__anonymous_0(field_assignment_punning,COMMA)) -> field_assignment_punning . COMMA seq(__anonymous_0(field_assignment_punning,COMMA)) [ RBRACE ]
##
## The known suffix of the stack is as follows:
## field_assignment_punning
##
## 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 156, spurious reduction of production call_expr_level_in -> core_expr
## In state 174, spurious reduction of production option(type_annotation_simple) ->
## In state 175, spurious reduction of production call_expr_level -> call_expr_level_in option(type_annotation_simple)
## In state 176, spurious reduction of production unary_expr_level -> call_expr_level
## In state 129, spurious reduction of production mult_expr_level -> unary_expr_level
## In state 153, spurious reduction of production add_expr_level -> mult_expr_level
## In state 184, spurious reduction of production cat_expr_level -> add_expr_level
## In state 205, spurious reduction of production comp_expr_level -> cat_expr_level
## In state 212, spurious reduction of production conj_expr_level -> comp_expr_level
## In state 219, spurious reduction of production disj_expr_level -> conj_expr_level
## In state 166, spurious reduction of production base_expr -> disj_expr_level
## In state 223, spurious reduction of production base_cond -> base_expr
## In state 224, spurious reduction of production expr -> base_cond
## In state 464, spurious reduction of production field_assignment -> Ident COLON expr
## In state 475, spurious reduction of production field_assignment_punning -> field_assignment
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LBRACE Ident COMMA Ident COMMA Ident COMMA WILD
##
## Ends in an error in state: 473.
##
## nsepseq(field_assignment_punning,COMMA) -> field_assignment_punning COMMA . nsepseq(field_assignment_punning,COMMA) [ RBRACE ]
## seq(__anonymous_0(field_assignment_punning,COMMA)) -> field_assignment_punning COMMA . seq(__anonymous_0(field_assignment_punning,COMMA)) [ RBRACE ]
##
## The known suffix of the stack is as follows:
## field_assignment_punning COMMA
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LBRACE Ident COMMA Ident COMMA WILD
##
## Ends in an error in state: 469.
##
## nsepseq(field_assignment_punning,COMMA) -> field_assignment_punning COMMA . nsepseq(field_assignment_punning,COMMA) [ RBRACE ]
## nseq(__anonymous_0(field_assignment_punning,COMMA)) -> field_assignment_punning COMMA . seq(__anonymous_0(field_assignment_punning,COMMA)) [ RBRACE ]
##
## The known suffix of the stack is as follows:
## field_assignment_punning COMMA
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LBRACE Ident COMMA Ident WILD
##
## Ends in an error in state: 462.
##
## field_assignment -> Ident . COLON expr [ RBRACE COMMA ]
## field_assignment_punning -> Ident . [ RBRACE COMMA ]
##
## The known suffix of the stack is as follows:
## Ident
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LBRACE Ident COMMA WILD
##
## Ends in an error in state: 461.
##
## more_field_assignments -> COMMA . sep_or_term_list(field_assignment_punning,COMMA) [ RBRACE ]
##
## The known suffix of the stack is as follows:
## COMMA
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LBRACE Ident WILD
##
## Ends in an error in state: 460.
##
## common_expr -> Ident . [ TIMES SLASH SEMI RBRACE PLUS Or NE Mod MINUS LT LPAR LE GT GE EQEQ COLON CAT BOOL_OR BOOL_AND ARROW ]
## field_assignment -> Ident . COLON expr [ RBRACE COMMA ]
## projection -> Ident . selection [ TIMES SLASH SEMI RBRACE PLUS Or NE Mod MINUS LT LPAR LE GT GE EQEQ COLON CAT BOOL_OR BOOL_AND ARROW ]
## sequence_or_record_in -> Ident . more_field_assignments [ RBRACE ]
##
## The known suffix of the stack is as follows:
## Ident
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LBRACE VBAR
##
## Ends in an error in state: 94.
##
## sequence_or_record -> LBRACE . sequence_or_record_in RBRACE [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LPAR LE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
## update_record -> LBRACE . ELLIPSIS path COMMA sep_or_term_list(field_path_assignment,COMMA) RBRACE [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LPAR LE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## LBRACE
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LBRACE WILD SEMI WILD SEMI VBAR
##
## Ends in an error in state: 490.
##
## nsepseq(expr_with_let_expr,SEMI) -> expr_with_let_expr SEMI . nsepseq(expr_with_let_expr,SEMI) [ RBRACE ]
## seq(__anonymous_0(expr_with_let_expr,SEMI)) -> expr_with_let_expr SEMI . seq(__anonymous_0(expr_with_let_expr,SEMI)) [ RBRACE ]
##
## The known suffix of the stack is as follows:
## expr_with_let_expr SEMI
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LBRACE WILD SEMI WILD VBAR
##
## Ends in an error in state: 489.
##
## nsepseq(expr_with_let_expr,SEMI) -> expr_with_let_expr . [ RBRACE ]
## nsepseq(expr_with_let_expr,SEMI) -> expr_with_let_expr . SEMI nsepseq(expr_with_let_expr,SEMI) [ RBRACE ]
## seq(__anonymous_0(expr_with_let_expr,SEMI)) -> expr_with_let_expr . SEMI seq(__anonymous_0(expr_with_let_expr,SEMI)) [ RBRACE ]
##
## The known suffix of the stack is as follows:
## expr_with_let_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 156, spurious reduction of production call_expr_level_in -> core_expr
## In state 174, spurious reduction of production option(type_annotation_simple) ->
## In state 175, spurious reduction of production call_expr_level -> call_expr_level_in option(type_annotation_simple)
## In state 176, spurious reduction of production unary_expr_level -> call_expr_level
## In state 129, spurious reduction of production mult_expr_level -> unary_expr_level
## In state 153, spurious reduction of production add_expr_level -> mult_expr_level
## In state 184, spurious reduction of production cat_expr_level -> add_expr_level
## In state 205, spurious reduction of production comp_expr_level -> cat_expr_level
## In state 212, spurious reduction of production conj_expr_level -> comp_expr_level
## In state 219, spurious reduction of production disj_expr_level -> conj_expr_level
## In state 166, spurious reduction of production base_expr -> disj_expr_level
## In state 223, spurious reduction of production base_cond -> base_expr
## In state 224, spurious reduction of production expr -> base_cond
## In state 401, spurious reduction of production expr_with_let_expr -> expr
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LBRACKET VBAR
##
## Ends in an error in state: 92.
##
## list_or_spread -> LBRACKET . expr COMMA sep_or_term_list(expr,COMMA) RBRACKET [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LPAR LE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
## list_or_spread -> LBRACKET . expr COMMA ELLIPSIS expr RBRACKET [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LPAR LE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
## list_or_spread -> LBRACKET . option(expr) RBRACKET [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LPAR LE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## LBRACKET
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LBRACKET WILD COMMA ELLIPSIS VBAR
##
## Ends in an error in state: 497.
##
## list_or_spread -> LBRACKET expr COMMA ELLIPSIS . expr RBRACKET [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LPAR LE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## LBRACKET expr COMMA ELLIPSIS
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LBRACKET WILD COMMA ELLIPSIS WILD VBAR
##
## Ends in an error in state: 498.
##
## list_or_spread -> LBRACKET expr COMMA ELLIPSIS expr . RBRACKET [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LPAR LE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## LBRACKET expr COMMA ELLIPSIS 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 156, spurious reduction of production call_expr_level_in -> core_expr
## In state 174, spurious reduction of production option(type_annotation_simple) ->
## In state 175, spurious reduction of production call_expr_level -> call_expr_level_in option(type_annotation_simple)
## In state 176, spurious reduction of production unary_expr_level -> call_expr_level
## In state 129, spurious reduction of production mult_expr_level -> unary_expr_level
## In state 153, spurious reduction of production add_expr_level -> mult_expr_level
## In state 184, spurious reduction of production cat_expr_level -> add_expr_level
## In state 205, spurious reduction of production comp_expr_level -> cat_expr_level
## In state 212, spurious reduction of production conj_expr_level -> comp_expr_level
## In state 219, spurious reduction of production disj_expr_level -> conj_expr_level
## In state 166, spurious reduction of production base_expr -> disj_expr_level
## In state 223, spurious reduction of production base_cond -> base_expr
## In state 224, spurious reduction of production expr -> base_cond
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LBRACKET WILD COMMA VBAR
##
## Ends in an error in state: 496.
##
## list_or_spread -> LBRACKET expr COMMA . sep_or_term_list(expr,COMMA) RBRACKET [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LPAR LE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
## list_or_spread -> LBRACKET expr COMMA . ELLIPSIS expr RBRACKET [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LPAR LE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## LBRACKET expr COMMA
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LBRACKET WILD COMMA WILD COMMA VBAR
##
## Ends in an error in state: 505.
##
## nsepseq(expr,COMMA) -> expr COMMA . nsepseq(expr,COMMA) [ RBRACKET ]
## nseq(__anonymous_0(expr,COMMA)) -> expr COMMA . seq(__anonymous_0(expr,COMMA)) [ RBRACKET ]
##
## The known suffix of the stack is as follows:
## expr COMMA
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LBRACKET WILD COMMA WILD COMMA WILD COMMA VBAR
##
## Ends in an error in state: 508.
##
## nsepseq(expr,COMMA) -> expr COMMA . nsepseq(expr,COMMA) [ RBRACKET ]
## seq(__anonymous_0(expr,COMMA)) -> expr COMMA . seq(__anonymous_0(expr,COMMA)) [ RBRACKET ]
##
## The known suffix of the stack is as follows:
## expr COMMA
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LBRACKET WILD COMMA WILD COMMA WILD VBAR
##
## Ends in an error in state: 507.
##
## nsepseq(expr,COMMA) -> expr . [ RBRACKET ]
## nsepseq(expr,COMMA) -> expr . COMMA nsepseq(expr,COMMA) [ RBRACKET ]
## seq(__anonymous_0(expr,COMMA)) -> expr . COMMA seq(__anonymous_0(expr,COMMA)) [ RBRACKET ]
##
## 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 156, spurious reduction of production call_expr_level_in -> core_expr
## In state 174, spurious reduction of production option(type_annotation_simple) ->
## In state 175, spurious reduction of production call_expr_level -> call_expr_level_in option(type_annotation_simple)
## In state 176, spurious reduction of production unary_expr_level -> call_expr_level
## In state 129, spurious reduction of production mult_expr_level -> unary_expr_level
## In state 153, spurious reduction of production add_expr_level -> mult_expr_level
## In state 184, spurious reduction of production cat_expr_level -> add_expr_level
## In state 205, spurious reduction of production comp_expr_level -> cat_expr_level
## In state 212, spurious reduction of production conj_expr_level -> comp_expr_level
## In state 219, spurious reduction of production disj_expr_level -> conj_expr_level
## In state 166, spurious reduction of production base_expr -> disj_expr_level
## In state 223, spurious reduction of production base_cond -> base_expr
## In state 224, spurious reduction of production expr -> base_cond
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LBRACKET WILD COMMA WILD VBAR
##
## Ends in an error in state: 504.
##
## nsepseq(expr,COMMA) -> expr . [ RBRACKET ]
## nsepseq(expr,COMMA) -> expr . COMMA nsepseq(expr,COMMA) [ RBRACKET ]
## nseq(__anonymous_0(expr,COMMA)) -> expr . COMMA seq(__anonymous_0(expr,COMMA)) [ RBRACKET ]
##
## 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 156, spurious reduction of production call_expr_level_in -> core_expr
## In state 174, spurious reduction of production option(type_annotation_simple) ->
## In state 175, spurious reduction of production call_expr_level -> call_expr_level_in option(type_annotation_simple)
## In state 176, spurious reduction of production unary_expr_level -> call_expr_level
## In state 129, spurious reduction of production mult_expr_level -> unary_expr_level
## In state 153, spurious reduction of production add_expr_level -> mult_expr_level
## In state 184, spurious reduction of production cat_expr_level -> add_expr_level
## In state 205, spurious reduction of production comp_expr_level -> cat_expr_level
## In state 212, spurious reduction of production conj_expr_level -> comp_expr_level
## In state 219, spurious reduction of production disj_expr_level -> conj_expr_level
## In state 166, spurious reduction of production base_expr -> disj_expr_level
## In state 223, spurious reduction of production base_cond -> base_expr
## In state 224, spurious reduction of production expr -> base_cond
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LBRACKET WILD VBAR
##
## Ends in an error in state: 495.
##
## list_or_spread -> LBRACKET expr . COMMA sep_or_term_list(expr,COMMA) RBRACKET [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LPAR LE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
## list_or_spread -> LBRACKET expr . COMMA ELLIPSIS expr RBRACKET [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LPAR LE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
## option(expr) -> expr . [ RBRACKET ]
##
## 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 156, spurious reduction of production call_expr_level_in -> core_expr
## In state 174, spurious reduction of production option(type_annotation_simple) ->
## In state 175, spurious reduction of production call_expr_level -> call_expr_level_in option(type_annotation_simple)
## In state 176, spurious reduction of production unary_expr_level -> call_expr_level
## In state 129, spurious reduction of production mult_expr_level -> unary_expr_level
## In state 153, spurious reduction of production add_expr_level -> mult_expr_level
## In state 184, spurious reduction of production cat_expr_level -> add_expr_level
## In state 205, spurious reduction of production comp_expr_level -> cat_expr_level
## In state 212, spurious reduction of production conj_expr_level -> comp_expr_level
## In state 219, spurious reduction of production disj_expr_level -> conj_expr_level
## In state 166, spurious reduction of production base_expr -> disj_expr_level
## In state 223, spurious reduction of production base_cond -> base_expr
## In state 224, spurious reduction of production expr -> base_cond
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LPAR VBAR
##
## Ends in an error in state: 95.
##
## par(expr) -> LPAR . expr RPAR [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LPAR LE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
## par(tuple(disj_expr_level)) -> LPAR . tuple(disj_expr_level) RPAR [ VBAR Type SEMI RPAR RBRACKET RBRACE Or Let EOF COMMA COLON BOOL_OR Attr ARROW ]
## unit -> LPAR . RPAR [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LPAR LE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## LPAR
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LPAR WILD COMMA Bytes RPAR COLON Ident TIMES
##
## Ends in an error in state: 166.
##
## base_expr -> disj_expr_level . [ VBAR Type SEMI RPAR RBRACKET RBRACE Let EOF COMMA Attr ]
## bin_op(disj_expr_level,BOOL_OR,conj_expr_level) -> disj_expr_level . BOOL_OR conj_expr_level [ VBAR Type SEMI RPAR RBRACKET RBRACE Or Let EOF COMMA BOOL_OR Attr ARROW ]
## bin_op(disj_expr_level,Or,conj_expr_level) -> disj_expr_level . Or conj_expr_level [ VBAR Type SEMI RPAR RBRACKET RBRACE Or Let EOF COMMA BOOL_OR Attr ARROW ]
## fun_expr(expr) -> disj_expr_level . ARROW expr [ VBAR Type SEMI RPAR RBRACKET RBRACE Let EOF COMMA Attr ]
##
## The known suffix of the stack is as follows:
## disj_expr_level
##
## 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 134, spurious reduction of production option(type_expr_simple_args) ->
## In state 143, spurious reduction of production type_expr_simple -> Ident option(type_expr_simple_args)
## In state 150, spurious reduction of production type_annotation_simple -> COLON type_expr_simple
## In state 151, spurious reduction of production option(type_annotation_simple) -> type_annotation_simple
## In state 152, spurious reduction of production disj_expr_level -> par(tuple(disj_expr_level)) option(type_annotation_simple)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LPAR WILD COMMA Bytes RPAR WILD
##
## Ends in an error in state: 131.
##
## disj_expr_level -> par(tuple(disj_expr_level)) . option(type_annotation_simple) [ VBAR Type SEMI RPAR RBRACKET RBRACE Or Let EOF COMMA BOOL_OR Attr ARROW ]
##
## The known suffix of the stack is as follows:
## par(tuple(disj_expr_level))
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LPAR WILD COMMA VBAR
##
## Ends in an error in state: 455.
##
## tuple(disj_expr_level) -> disj_expr_level COMMA . nsepseq(disj_expr_level,COMMA) [ RPAR ]
##
## The known suffix of the stack is as follows:
## disj_expr_level COMMA
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LPAR WILD COMMA WILD COMMA VBAR
##
## Ends in an error in state: 458.
##
## nsepseq(disj_expr_level,COMMA) -> disj_expr_level COMMA . nsepseq(disj_expr_level,COMMA) [ RPAR ]
##
## The known suffix of the stack is as follows:
## disj_expr_level COMMA
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LPAR WILD COMMA WILD VBAR
##
## Ends in an error in state: 457.
##
## bin_op(disj_expr_level,BOOL_OR,conj_expr_level) -> disj_expr_level . BOOL_OR conj_expr_level [ RPAR Or COMMA BOOL_OR ]
## bin_op(disj_expr_level,Or,conj_expr_level) -> disj_expr_level . Or conj_expr_level [ RPAR Or COMMA BOOL_OR ]
## nsepseq(disj_expr_level,COMMA) -> disj_expr_level . [ RPAR ]
## nsepseq(disj_expr_level,COMMA) -> disj_expr_level . COMMA nsepseq(disj_expr_level,COMMA) [ RPAR ]
##
## The known suffix of the stack is as follows:
## disj_expr_level
##
## 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 156, spurious reduction of production call_expr_level_in -> core_expr
## In state 174, spurious reduction of production option(type_annotation_simple) ->
## In state 175, spurious reduction of production call_expr_level -> call_expr_level_in option(type_annotation_simple)
## In state 176, spurious reduction of production unary_expr_level -> call_expr_level
## In state 129, spurious reduction of production mult_expr_level -> unary_expr_level
## In state 153, spurious reduction of production add_expr_level -> mult_expr_level
## In state 184, spurious reduction of production cat_expr_level -> add_expr_level
## In state 205, spurious reduction of production comp_expr_level -> cat_expr_level
## In state 212, spurious reduction of production conj_expr_level -> comp_expr_level
## In state 219, spurious reduction of production disj_expr_level -> conj_expr_level
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: LPAR WILD VBAR
##
## Ends in an error in state: 454.
##
## base_expr -> disj_expr_level . [ RPAR ]
## bin_op(disj_expr_level,BOOL_OR,conj_expr_level) -> disj_expr_level . BOOL_OR conj_expr_level [ RPAR Or COMMA BOOL_OR ARROW ]
## bin_op(disj_expr_level,Or,conj_expr_level) -> disj_expr_level . Or conj_expr_level [ RPAR Or COMMA BOOL_OR ARROW ]
## fun_expr(expr) -> disj_expr_level . ARROW expr [ RPAR ]
## tuple(disj_expr_level) -> disj_expr_level . COMMA nsepseq(disj_expr_level,COMMA) [ RPAR ]
##
## The known suffix of the stack is as follows:
## disj_expr_level
##
## 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 156, spurious reduction of production call_expr_level_in -> core_expr
## In state 174, spurious reduction of production option(type_annotation_simple) ->
## In state 175, spurious reduction of production call_expr_level -> call_expr_level_in option(type_annotation_simple)
## In state 176, spurious reduction of production unary_expr_level -> call_expr_level
## In state 129, spurious reduction of production mult_expr_level -> unary_expr_level
## In state 153, spurious reduction of production add_expr_level -> mult_expr_level
## In state 184, spurious reduction of production cat_expr_level -> add_expr_level
## In state 205, spurious reduction of production comp_expr_level -> cat_expr_level
## In state 212, spurious reduction of production conj_expr_level -> comp_expr_level
## In state 219, spurious reduction of production disj_expr_level -> conj_expr_level
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Let Rec VBAR
##
## Ends in an error in state: 355.
##
## let_expr(expr_with_let_expr) -> seq(Attr) Let Rec . let_binding SEMI expr_with_let_expr [ SEMI RBRACE EOF ]
##
## The known suffix of the stack is as follows:
## seq(Attr) Let Rec
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Let Rec WILD EQ Bytes SEMI VBAR
##
## Ends in an error in state: 398.
##
## let_expr(expr_with_let_expr) -> seq(Attr) Let Rec let_binding SEMI . expr_with_let_expr [ SEMI RBRACE EOF ]
##
## The known suffix of the stack is as follows:
## seq(Attr) Let Rec let_binding SEMI
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Let Rec WILD EQ Bytes VBAR
##
## Ends in an error in state: 397.
##
## let_expr(expr_with_let_expr) -> seq(Attr) Let Rec let_binding . SEMI expr_with_let_expr [ SEMI RBRACE EOF ]
##
## The known suffix of the stack is as follows:
## seq(Attr) Let Rec let_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 156, spurious reduction of production call_expr_level_in -> core_expr
## In state 174, spurious reduction of production option(type_annotation_simple) ->
## In state 175, spurious reduction of production call_expr_level -> call_expr_level_in option(type_annotation_simple)
## In state 176, spurious reduction of production unary_expr_level -> call_expr_level
## In state 129, spurious reduction of production mult_expr_level -> unary_expr_level
## In state 153, spurious reduction of production add_expr_level -> mult_expr_level
## In state 184, spurious reduction of production cat_expr_level -> add_expr_level
## In state 205, spurious reduction of production comp_expr_level -> cat_expr_level
## In state 212, spurious reduction of production conj_expr_level -> comp_expr_level
## In state 219, spurious reduction of production disj_expr_level -> conj_expr_level
## In state 166, spurious reduction of production base_expr -> disj_expr_level
## In state 223, spurious reduction of production base_cond -> base_expr
## In state 224, spurious reduction of production expr -> base_cond
## In state 525, spurious reduction of production let_binding -> WILD option(type_annotation) EQ expr
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Let VBAR
##
## Ends in an error in state: 354.
##
## let_expr(expr_with_let_expr) -> seq(Attr) Let . let_binding SEMI expr_with_let_expr [ SEMI RBRACE EOF ]
## let_expr(expr_with_let_expr) -> seq(Attr) Let . Rec let_binding SEMI expr_with_let_expr [ SEMI RBRACE EOF ]
##
## The known suffix of the stack is as follows:
## seq(Attr) Let
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Let WILD EQ Bytes SEMI VBAR
##
## Ends in an error in state: 403.
##
## let_expr(expr_with_let_expr) -> seq(Attr) Let let_binding SEMI . expr_with_let_expr [ SEMI RBRACE EOF ]
##
## The known suffix of the stack is as follows:
## seq(Attr) Let let_binding SEMI
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Let WILD EQ Bytes VBAR
##
## Ends in an error in state: 402.
##
## let_expr(expr_with_let_expr) -> seq(Attr) Let let_binding . SEMI expr_with_let_expr [ SEMI RBRACE EOF ]
##
## The known suffix of the stack is as follows:
## seq(Attr) Let let_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 156, spurious reduction of production call_expr_level_in -> core_expr
## In state 174, spurious reduction of production option(type_annotation_simple) ->
## In state 175, spurious reduction of production call_expr_level -> call_expr_level_in option(type_annotation_simple)
## In state 176, spurious reduction of production unary_expr_level -> call_expr_level
## In state 129, spurious reduction of production mult_expr_level -> unary_expr_level
## In state 153, spurious reduction of production add_expr_level -> mult_expr_level
## In state 184, spurious reduction of production cat_expr_level -> add_expr_level
## In state 205, spurious reduction of production comp_expr_level -> cat_expr_level
## In state 212, spurious reduction of production conj_expr_level -> comp_expr_level
## In state 219, spurious reduction of production disj_expr_level -> conj_expr_level
## In state 166, spurious reduction of production base_expr -> disj_expr_level
## In state 223, spurious reduction of production base_cond -> base_expr
## In state 224, spurious reduction of production expr -> base_cond
## In state 525, spurious reduction of production let_binding -> WILD option(type_annotation) EQ expr
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: MINUS VBAR
##
## Ends in an error in state: 93.
##
## unary_expr_level -> MINUS . call_expr_level [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LE GT GE EQEQ EOF COMMA CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## MINUS
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: NOT VBAR
##
## Ends in an error in state: 91.
##
## unary_expr_level -> NOT . call_expr_level [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LE GT GE EQEQ EOF COMMA CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## NOT
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Switch Constr WILD
##
## Ends in an error in state: 115.
##
## module_field -> Constr . DOT module_fun [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LE LBRACE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
## projection -> Constr . DOT Ident selection [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LE LBRACE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## Constr
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Switch LBRACE WILD
##
## Ends in an error in state: 247.
##
## update_record -> LBRACE . ELLIPSIS path COMMA sep_or_term_list(field_path_assignment,COMMA) RBRACE [ LBRACE ]
##
## The known suffix of the stack is as follows:
## LBRACE
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Switch LBRACKET VBAR
##
## Ends in an error in state: 234.
##
## list__(expr) -> LBRACKET . option(sep_or_term_list(expr,SEMI)) RBRACKET [ LBRACE ]
##
## The known suffix of the stack is as follows:
## LBRACKET
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Switch LBRACKET WILD SEMI VBAR
##
## Ends in an error in state: 241.
##
## nsepseq(expr,SEMI) -> expr SEMI . nsepseq(expr,SEMI) [ RBRACKET ]
## nseq(__anonymous_0(expr,SEMI)) -> expr SEMI . seq(__anonymous_0(expr,SEMI)) [ RBRACKET ]
##
## The known suffix of the stack is as follows:
## expr SEMI
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Switch LBRACKET WILD SEMI WILD SEMI VBAR
##
## Ends in an error in state: 245.
##
## nsepseq(expr,SEMI) -> expr SEMI . nsepseq(expr,SEMI) [ RBRACKET ]
## seq(__anonymous_0(expr,SEMI)) -> expr SEMI . seq(__anonymous_0(expr,SEMI)) [ RBRACKET ]
##
## The known suffix of the stack is as follows:
## expr SEMI
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Switch LBRACKET WILD SEMI WILD VBAR
##
## Ends in an error in state: 244.
##
## nsepseq(expr,SEMI) -> expr . [ RBRACKET ]
## nsepseq(expr,SEMI) -> expr . SEMI nsepseq(expr,SEMI) [ RBRACKET ]
## seq(__anonymous_0(expr,SEMI)) -> expr . SEMI seq(__anonymous_0(expr,SEMI)) [ RBRACKET ]
##
## 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 156, spurious reduction of production call_expr_level_in -> core_expr
## In state 174, spurious reduction of production option(type_annotation_simple) ->
## In state 175, spurious reduction of production call_expr_level -> call_expr_level_in option(type_annotation_simple)
## In state 176, spurious reduction of production unary_expr_level -> call_expr_level
## In state 129, spurious reduction of production mult_expr_level -> unary_expr_level
## In state 153, spurious reduction of production add_expr_level -> mult_expr_level
## In state 184, spurious reduction of production cat_expr_level -> add_expr_level
## In state 205, spurious reduction of production comp_expr_level -> cat_expr_level
## In state 212, spurious reduction of production conj_expr_level -> comp_expr_level
## In state 219, spurious reduction of production disj_expr_level -> conj_expr_level
## In state 166, spurious reduction of production base_expr -> disj_expr_level
## In state 223, spurious reduction of production base_cond -> base_expr
## In state 224, spurious reduction of production expr -> base_cond
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Switch LBRACKET WILD VBAR
##
## Ends in an error in state: 240.
##
## nsepseq(expr,SEMI) -> expr . [ RBRACKET ]
## nsepseq(expr,SEMI) -> expr . SEMI nsepseq(expr,SEMI) [ RBRACKET ]
## nseq(__anonymous_0(expr,SEMI)) -> expr . SEMI seq(__anonymous_0(expr,SEMI)) [ RBRACKET ]
##
## 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 156, spurious reduction of production call_expr_level_in -> core_expr
## In state 174, spurious reduction of production option(type_annotation_simple) ->
## In state 175, spurious reduction of production call_expr_level -> call_expr_level_in option(type_annotation_simple)
## In state 176, spurious reduction of production unary_expr_level -> call_expr_level
## In state 129, spurious reduction of production mult_expr_level -> unary_expr_level
## In state 153, spurious reduction of production add_expr_level -> mult_expr_level
## In state 184, spurious reduction of production cat_expr_level -> add_expr_level
## In state 205, spurious reduction of production comp_expr_level -> cat_expr_level
## In state 212, spurious reduction of production conj_expr_level -> comp_expr_level
## In state 219, spurious reduction of production disj_expr_level -> conj_expr_level
## In state 166, spurious reduction of production base_expr -> disj_expr_level
## In state 223, spurious reduction of production base_cond -> base_expr
## In state 224, spurious reduction of production expr -> base_cond
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Switch LPAR VBAR
##
## Ends in an error in state: 89.
##
## par(expr) -> LPAR . expr RPAR [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LPAR LE LBRACE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
## unit -> LPAR . RPAR [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LPAR LE LBRACE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## LPAR
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Switch LPAR WILD VBAR
##
## Ends in an error in state: 452.
##
## par(expr) -> LPAR expr . RPAR [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LPAR LE LBRACE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## 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 156, spurious reduction of production call_expr_level_in -> core_expr
## In state 174, spurious reduction of production option(type_annotation_simple) ->
## In state 175, spurious reduction of production call_expr_level -> call_expr_level_in option(type_annotation_simple)
## In state 176, spurious reduction of production unary_expr_level -> call_expr_level
## In state 129, spurious reduction of production mult_expr_level -> unary_expr_level
## In state 153, spurious reduction of production add_expr_level -> mult_expr_level
## In state 184, spurious reduction of production cat_expr_level -> add_expr_level
## In state 205, spurious reduction of production comp_expr_level -> cat_expr_level
## In state 212, spurious reduction of production conj_expr_level -> comp_expr_level
## In state 219, spurious reduction of production disj_expr_level -> conj_expr_level
## In state 166, spurious reduction of production base_expr -> disj_expr_level
## In state 223, spurious reduction of production base_cond -> base_expr
## In state 224, spurious reduction of production expr -> base_cond
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Switch VBAR
##
## Ends in an error in state: 85.
##
## switch_expr(base_cond) -> Switch . switch_expr_ LBRACE cases(base_cond) RBRACE [ VBAR Type SEMI RPAR RBRACKET RBRACE Let EOF COMMA Attr ]
##
## The known suffix of the stack is as follows:
## Switch
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Switch WILD LBRACE VBAR LBRACKET VBAR
##
## Ends in an error in state: 336.
##
## list__(sub_pattern) -> LBRACKET . option(sep_or_term_list(sub_pattern,SEMI)) RBRACKET [ COMMA ARROW ]
## pattern -> LBRACKET . sub_pattern COMMA ELLIPSIS sub_pattern RBRACKET [ ARROW ]
##
## The known suffix of the stack is as follows:
## LBRACKET
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Switch WILD LBRACE VBAR LBRACKET WILD COMMA ELLIPSIS VBAR
##
## Ends in an error in state: 339.
##
## pattern -> LBRACKET sub_pattern COMMA ELLIPSIS . sub_pattern RBRACKET [ ARROW ]
##
## The known suffix of the stack is as follows:
## LBRACKET sub_pattern COMMA ELLIPSIS
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Switch WILD LBRACE VBAR LBRACKET WILD COMMA ELLIPSIS WILD WILD
##
## Ends in an error in state: 340.
##
## pattern -> LBRACKET sub_pattern COMMA ELLIPSIS sub_pattern . RBRACKET [ ARROW ]
##
## The known suffix of the stack is as follows:
## LBRACKET sub_pattern COMMA ELLIPSIS sub_pattern
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Switch WILD LBRACE VBAR LBRACKET WILD COMMA WILD
##
## Ends in an error in state: 338.
##
## pattern -> LBRACKET sub_pattern COMMA . ELLIPSIS sub_pattern RBRACKET [ ARROW ]
##
## The known suffix of the stack is as follows:
## LBRACKET sub_pattern COMMA
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Switch WILD LBRACE VBAR LBRACKET WILD WILD
##
## Ends in an error in state: 337.
##
## nsepseq(sub_pattern,SEMI) -> sub_pattern . [ RBRACKET ]
## nsepseq(sub_pattern,SEMI) -> sub_pattern . SEMI nsepseq(sub_pattern,SEMI) [ RBRACKET ]
## nseq(__anonymous_0(sub_pattern,SEMI)) -> sub_pattern . SEMI seq(__anonymous_0(sub_pattern,SEMI)) [ RBRACKET ]
## pattern -> LBRACKET sub_pattern . COMMA ELLIPSIS sub_pattern RBRACKET [ ARROW ]
##
## The known suffix of the stack is as follows:
## LBRACKET sub_pattern
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Switch WILD LBRACE VBAR LPAR Bytes RPAR WILD
##
## Ends in an error in state: 343.
##
## tuple(sub_pattern) -> sub_pattern . COMMA nsepseq(sub_pattern,COMMA) [ ARROW ]
##
## The known suffix of the stack is as follows:
## sub_pattern
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Switch WILD LBRACE VBAR VBAR
##
## Ends in an error in state: 513.
##
## case_clause(base_cond) -> VBAR . pattern ARROW base_cond option(SEMI) [ VBAR RBRACE ]
##
## The known suffix of the stack is as follows:
## VBAR
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Switch WILD LBRACE VBAR WILD ARROW Bytes SEMI WILD
##
## Ends in an error in state: 521.
##
## nseq(case_clause(base_cond)) -> case_clause(base_cond) . seq(case_clause(base_cond)) [ RBRACE ]
##
## The known suffix of the stack is as follows:
## case_clause(base_cond)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Switch WILD LBRACE VBAR WILD ARROW Bytes VBAR Bytes ARROW Bytes SEMI WILD
##
## Ends in an error in state: 523.
##
## seq(case_clause(base_cond)) -> case_clause(base_cond) . seq(case_clause(base_cond)) [ RBRACE ]
##
## The known suffix of the stack is as follows:
## case_clause(base_cond)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Switch WILD LBRACE VBAR WILD ARROW VBAR
##
## Ends in an error in state: 515.
##
## case_clause(base_cond) -> VBAR pattern ARROW . base_cond option(SEMI) [ VBAR RBRACE ]
##
## The known suffix of the stack is as follows:
## VBAR pattern ARROW
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Switch WILD LBRACE VBAR WILD ARROW WILD Type
##
## Ends in an error in state: 516.
##
## case_clause(base_cond) -> VBAR pattern ARROW base_cond . option(SEMI) [ VBAR RBRACE ]
##
## The known suffix of the stack is as follows:
## VBAR pattern ARROW base_cond
##
## 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 156, spurious reduction of production call_expr_level_in -> core_expr
## In state 174, spurious reduction of production option(type_annotation_simple) ->
## In state 175, spurious reduction of production call_expr_level -> call_expr_level_in option(type_annotation_simple)
## In state 176, spurious reduction of production unary_expr_level -> call_expr_level
## In state 129, spurious reduction of production mult_expr_level -> unary_expr_level
## In state 153, spurious reduction of production add_expr_level -> mult_expr_level
## In state 184, spurious reduction of production cat_expr_level -> add_expr_level
## In state 205, spurious reduction of production comp_expr_level -> cat_expr_level
## In state 212, spurious reduction of production conj_expr_level -> comp_expr_level
## In state 219, spurious reduction of production disj_expr_level -> conj_expr_level
## In state 166, spurious reduction of production base_expr -> disj_expr_level
## In state 223, spurious reduction of production base_cond -> base_expr
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Switch WILD LBRACE VBAR WILD COMMA Bytes RPAR
##
## Ends in an error in state: 514.
##
## case_clause(base_cond) -> VBAR pattern . ARROW base_cond option(SEMI) [ VBAR RBRACE ]
##
## The known suffix of the stack is as follows:
## VBAR 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 330, spurious reduction of production nsepseq(sub_pattern,COMMA) -> sub_pattern
## In state 333, spurious reduction of production tuple(sub_pattern) -> sub_pattern COMMA nsepseq(sub_pattern,COMMA)
## In state 342, spurious reduction of production pattern -> tuple(sub_pattern)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Switch WILD LBRACE VBAR WILD COMMA VBAR
##
## Ends in an error in state: 329.
##
## tuple(sub_pattern) -> sub_pattern COMMA . nsepseq(sub_pattern,COMMA) [ RPAR ARROW ]
##
## The known suffix of the stack is as follows:
## sub_pattern COMMA
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Switch WILD LBRACE VBAR WILD COMMA WILD COMMA VBAR
##
## Ends in an error in state: 331.
##
## nsepseq(sub_pattern,COMMA) -> sub_pattern COMMA . nsepseq(sub_pattern,COMMA) [ RPAR ARROW ]
##
## The known suffix of the stack is as follows:
## sub_pattern COMMA
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Switch WILD LBRACE VBAR WILD COMMA WILD WILD
##
## Ends in an error in state: 330.
##
## nsepseq(sub_pattern,COMMA) -> sub_pattern . [ RPAR ARROW ]
## nsepseq(sub_pattern,COMMA) -> sub_pattern . COMMA nsepseq(sub_pattern,COMMA) [ RPAR ARROW ]
##
## The known suffix of the stack is as follows:
## sub_pattern
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Switch WILD LBRACE VBAR WILD WILD
##
## Ends in an error in state: 430.
##
## pattern -> core_pattern . [ ARROW ]
## sub_pattern -> core_pattern . [ COMMA ]
##
## The known suffix of the stack is as follows:
## core_pattern
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Switch WILD LBRACE WILD
##
## Ends in an error in state: 512.
##
## switch_expr(base_cond) -> Switch switch_expr_ LBRACE . cases(base_cond) RBRACE [ VBAR Type SEMI RPAR RBRACKET RBRACE Let EOF COMMA Attr ]
##
## The known suffix of the stack is as follows:
## Switch switch_expr_ LBRACE
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: Switch WILD WILD
##
## Ends in an error in state: 511.
##
## switch_expr(base_cond) -> Switch switch_expr_ . LBRACE cases(base_cond) RBRACE [ VBAR Type SEMI RPAR RBRACKET RBRACE Let EOF COMMA Attr ]
##
## The known suffix of the stack is as follows:
## Switch switch_expr_
##

<YOUR SYNTAX ERROR MESSAGE HERE>

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

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: WILD ARROW VBAR
##
## Ends in an error in state: 216.
##
## fun_expr(expr) -> disj_expr_level ARROW . expr [ VBAR Type SEMI RPAR RBRACKET RBRACE Let EOF COMMA Attr ]
##
## The known suffix of the stack is as follows:
## disj_expr_level ARROW
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: WILD BOOL_AND VBAR
##
## Ends in an error in state: 170.
##
## bin_op(conj_expr_level,BOOL_AND,comp_expr_level) -> conj_expr_level BOOL_AND . comp_expr_level [ VBAR Type SEMI RPAR RBRACKET RBRACE Or Let EOF COMMA BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## conj_expr_level BOOL_AND
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: WILD BOOL_OR VBAR
##
## Ends in an error in state: 214.
##
## bin_op(disj_expr_level,BOOL_OR,conj_expr_level) -> disj_expr_level BOOL_OR . conj_expr_level [ VBAR Type SEMI RPAR RBRACKET RBRACE Or Let EOF COMMA BOOL_OR Attr ARROW ]
##
## The known suffix of the stack is as follows:
## disj_expr_level BOOL_OR
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: WILD CAT VBAR
##
## Ends in an error in state: 193.
##
## bin_op(add_expr_level,CAT,cat_expr_level) -> add_expr_level CAT . cat_expr_level [ VBAR Type SEMI RPAR RBRACKET RBRACE Or NE Let LT LE GT GE EQEQ EOF COMMA BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## add_expr_level CAT
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: WILD COLON Ident LPAR Ident VBAR
##
## Ends in an error in state: 136.
##
## nsepseq(type_expr_simple,COMMA) -> type_expr_simple . [ RPAR ]
## nsepseq(type_expr_simple,COMMA) -> type_expr_simple . COMMA nsepseq(type_expr_simple,COMMA) [ RPAR ]
##
## The known suffix of the stack is as follows:
## type_expr_simple
##
## 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 134, spurious reduction of production option(type_expr_simple_args) ->
## In state 143, spurious reduction of production type_expr_simple -> Ident option(type_expr_simple_args)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: WILD COLON Ident LPAR WILD
##
## Ends in an error in state: 135.
##
## par(nsepseq(type_expr_simple,COMMA)) -> LPAR . nsepseq(type_expr_simple,COMMA) RPAR [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LE GT GE EQEQ EOF COMMA CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## LPAR
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: WILD COLON Ident WILD
##
## Ends in an error in state: 134.
##
## type_expr_simple -> Ident . option(type_expr_simple_args) [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LE GT GE EQEQ EOF COMMA CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## Ident
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: WILD COLON LPAR Ident ARROW Ident VBAR
##
## Ends in an error in state: 146.
##
## type_expr_simple -> LPAR type_expr_simple ARROW type_expr_simple . RPAR [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LE GT GE EQEQ EOF COMMA CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## LPAR type_expr_simple ARROW type_expr_simple
##
## 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 134, spurious reduction of production option(type_expr_simple_args) ->
## In state 143, spurious reduction of production type_expr_simple -> Ident option(type_expr_simple_args)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: WILD COLON LPAR Ident ARROW WILD
##
## Ends in an error in state: 145.
##
## type_expr_simple -> LPAR type_expr_simple ARROW . type_expr_simple RPAR [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LE GT GE EQEQ EOF COMMA CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## LPAR type_expr_simple ARROW
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: WILD COLON LPAR Ident COMMA WILD
##
## Ends in an error in state: 137.
##
## nsepseq(type_expr_simple,COMMA) -> type_expr_simple COMMA . nsepseq(type_expr_simple,COMMA) [ RPAR ]
##
## The known suffix of the stack is as follows:
## type_expr_simple COMMA
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: WILD COLON LPAR Ident RPAR WILD
##
## Ends in an error in state: 153.
##
## add_expr_level -> mult_expr_level . [ VBAR Type SEMI RPAR RBRACKET RBRACE PLUS Or NE MINUS Let LT LE GT GE EQEQ EOF COMMA CAT BOOL_OR BOOL_AND Attr ARROW ]
## bin_op(mult_expr_level,Mod,unary_expr_level) -> mult_expr_level . Mod unary_expr_level [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LE GT GE EQEQ EOF COMMA CAT BOOL_OR BOOL_AND Attr ARROW ]
## bin_op(mult_expr_level,SLASH,unary_expr_level) -> mult_expr_level . SLASH unary_expr_level [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LE GT GE EQEQ EOF COMMA CAT BOOL_OR BOOL_AND Attr ARROW ]
## bin_op(mult_expr_level,TIMES,unary_expr_level) -> mult_expr_level . TIMES unary_expr_level [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LE GT GE EQEQ EOF COMMA CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## mult_expr_level
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: WILD COLON LPAR Ident VBAR
##
## Ends in an error in state: 144.
##
## nsepseq(type_expr_simple,COMMA) -> type_expr_simple . [ RPAR ]
## nsepseq(type_expr_simple,COMMA) -> type_expr_simple . COMMA nsepseq(type_expr_simple,COMMA) [ RPAR ]
## type_expr_simple -> LPAR type_expr_simple . ARROW type_expr_simple RPAR [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LE GT GE EQEQ EOF COMMA CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## LPAR type_expr_simple
##
## 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 134, spurious reduction of production option(type_expr_simple_args) ->
## In state 143, spurious reduction of production type_expr_simple -> Ident option(type_expr_simple_args)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: WILD COLON LPAR WILD
##
## Ends in an error in state: 133.
##
## type_expr_simple -> LPAR . nsepseq(type_expr_simple,COMMA) RPAR [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LE GT GE EQEQ EOF COMMA CAT BOOL_OR BOOL_AND Attr ARROW ]
## type_expr_simple -> LPAR . type_expr_simple ARROW type_expr_simple RPAR [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LE GT GE EQEQ EOF COMMA CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## LPAR
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: WILD COLON WILD
##
## Ends in an error in state: 132.
##
## type_annotation_simple -> COLON . type_expr_simple [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LE GT GE EQEQ EOF COMMA CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## COLON
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: WILD EQEQ VBAR
##
## Ends in an error in state: 203.
##
## bin_op(comp_expr_level,EQEQ,cat_expr_level) -> comp_expr_level EQEQ . cat_expr_level [ VBAR Type SEMI RPAR RBRACKET RBRACE Or NE Let LT LE GT GE EQEQ EOF COMMA BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## comp_expr_level EQEQ
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: WILD GE VBAR
##
## Ends in an error in state: 201.
##
## bin_op(comp_expr_level,GE,cat_expr_level) -> comp_expr_level GE . cat_expr_level [ VBAR Type SEMI RPAR RBRACKET RBRACE Or NE Let LT LE GT GE EQEQ EOF COMMA BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## comp_expr_level GE
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: WILD GT VBAR
##
## Ends in an error in state: 199.
##
## bin_op(comp_expr_level,GT,cat_expr_level) -> comp_expr_level GT . cat_expr_level [ VBAR Type SEMI RPAR RBRACKET RBRACE Or NE Let LT LE GT GE EQEQ EOF COMMA BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## comp_expr_level GT
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: WILD LE VBAR
##
## Ends in an error in state: 197.
##
## bin_op(comp_expr_level,LE,cat_expr_level) -> comp_expr_level LE . cat_expr_level [ VBAR Type SEMI RPAR RBRACKET RBRACE Or NE Let LT LE GT GE EQEQ EOF COMMA BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## comp_expr_level LE
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: WILD LPAR VBAR
##
## Ends in an error in state: 157.
##
## call_expr -> core_expr LPAR . nsepseq(expr,COMMA) RPAR [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
## unit -> LPAR . RPAR [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## core_expr LPAR
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: WILD LPAR WILD COMMA VBAR
##
## Ends in an error in state: 164.
##
## 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: WILD LPAR WILD VBAR
##
## Ends in an error in state: 163.
##
## 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 156, spurious reduction of production call_expr_level_in -> core_expr
## In state 174, spurious reduction of production option(type_annotation_simple) ->
## In state 175, spurious reduction of production call_expr_level -> call_expr_level_in option(type_annotation_simple)
## In state 176, spurious reduction of production unary_expr_level -> call_expr_level
## In state 129, spurious reduction of production mult_expr_level -> unary_expr_level
## In state 153, spurious reduction of production add_expr_level -> mult_expr_level
## In state 184, spurious reduction of production cat_expr_level -> add_expr_level
## In state 205, spurious reduction of production comp_expr_level -> cat_expr_level
## In state 212, spurious reduction of production conj_expr_level -> comp_expr_level
## In state 219, spurious reduction of production disj_expr_level -> conj_expr_level
## In state 166, spurious reduction of production base_expr -> disj_expr_level
## In state 223, spurious reduction of production base_cond -> base_expr
## In state 224, spurious reduction of production expr -> base_cond
##

Missing `)`.

interactive_expr: WILD LT VBAR
##
## Ends in an error in state: 195.
##
## bin_op(comp_expr_level,LT,cat_expr_level) -> comp_expr_level LT . cat_expr_level [ VBAR Type SEMI RPAR RBRACKET RBRACE Or NE Let LT LE GT GE EQEQ EOF COMMA BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## comp_expr_level LT
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: WILD MINUS VBAR
##
## Ends in an error in state: 191.
##
## bin_op(add_expr_level,MINUS,mult_expr_level) -> add_expr_level MINUS . mult_expr_level [ VBAR Type SEMI RPAR RBRACKET RBRACE PLUS Or NE MINUS Let LT LE GT GE EQEQ EOF COMMA CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## add_expr_level MINUS
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: WILD MINUS WILD COLON LPAR Ident RPAR WILD
##
## Ends in an error in state: 192.
##
## bin_op(add_expr_level,MINUS,mult_expr_level) -> add_expr_level MINUS mult_expr_level . [ VBAR Type SEMI RPAR RBRACKET RBRACE PLUS Or NE MINUS Let LT LE GT GE EQEQ EOF COMMA CAT BOOL_OR BOOL_AND Attr ARROW ]
## bin_op(mult_expr_level,Mod,unary_expr_level) -> mult_expr_level . Mod unary_expr_level [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LE GT GE EQEQ EOF COMMA CAT BOOL_OR BOOL_AND Attr ARROW ]
## bin_op(mult_expr_level,SLASH,unary_expr_level) -> mult_expr_level . SLASH unary_expr_level [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LE GT GE EQEQ EOF COMMA CAT BOOL_OR BOOL_AND Attr ARROW ]
## bin_op(mult_expr_level,TIMES,unary_expr_level) -> mult_expr_level . TIMES unary_expr_level [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LE GT GE EQEQ EOF COMMA CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## add_expr_level MINUS mult_expr_level
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: WILD Mod VBAR
##
## Ends in an error in state: 189.
##
## bin_op(mult_expr_level,Mod,unary_expr_level) -> mult_expr_level Mod . unary_expr_level [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LE GT GE EQEQ EOF COMMA CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## mult_expr_level Mod
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: WILD NE VBAR
##
## Ends in an error in state: 172.
##
## bin_op(comp_expr_level,NE,cat_expr_level) -> comp_expr_level NE . cat_expr_level [ VBAR Type SEMI RPAR RBRACKET RBRACE Or NE Let LT LE GT GE EQEQ EOF COMMA BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## comp_expr_level NE
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: WILD Or VBAR
##
## Ends in an error in state: 167.
##
## bin_op(disj_expr_level,Or,conj_expr_level) -> disj_expr_level Or . conj_expr_level [ VBAR Type SEMI RPAR RBRACKET RBRACE Or Let EOF COMMA BOOL_OR Attr ARROW ]
##
## The known suffix of the stack is as follows:
## disj_expr_level Or
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: WILD PLUS VBAR
##
## Ends in an error in state: 185.
##
## bin_op(add_expr_level,PLUS,mult_expr_level) -> add_expr_level PLUS . mult_expr_level [ VBAR Type SEMI RPAR RBRACKET RBRACE PLUS Or NE MINUS Let LT LE GT GE EQEQ EOF COMMA CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## add_expr_level PLUS
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: WILD PLUS WILD COLON LPAR Ident RPAR WILD
##
## Ends in an error in state: 186.
##
## bin_op(add_expr_level,PLUS,mult_expr_level) -> add_expr_level PLUS mult_expr_level . [ VBAR Type SEMI RPAR RBRACKET RBRACE PLUS Or NE MINUS Let LT LE GT GE EQEQ EOF COMMA CAT BOOL_OR BOOL_AND Attr ARROW ]
## bin_op(mult_expr_level,Mod,unary_expr_level) -> mult_expr_level . Mod unary_expr_level [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LE GT GE EQEQ EOF COMMA CAT BOOL_OR BOOL_AND Attr ARROW ]
## bin_op(mult_expr_level,SLASH,unary_expr_level) -> mult_expr_level . SLASH unary_expr_level [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LE GT GE EQEQ EOF COMMA CAT BOOL_OR BOOL_AND Attr ARROW ]
## bin_op(mult_expr_level,TIMES,unary_expr_level) -> mult_expr_level . TIMES unary_expr_level [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LE GT GE EQEQ EOF COMMA CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## add_expr_level PLUS mult_expr_level
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: WILD SLASH VBAR
##
## Ends in an error in state: 187.
##
## bin_op(mult_expr_level,SLASH,unary_expr_level) -> mult_expr_level SLASH . unary_expr_level [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LE GT GE EQEQ EOF COMMA CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## mult_expr_level SLASH
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: WILD TIMES VBAR
##
## Ends in an error in state: 154.
##
## bin_op(mult_expr_level,TIMES,unary_expr_level) -> mult_expr_level TIMES . unary_expr_level [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LE GT GE EQEQ EOF COMMA CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## mult_expr_level TIMES
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: WILD VBAR
##
## Ends in an error in state: 538.
##
## interactive_expr -> expr_with_let_expr . EOF [ # ]
##
## The known suffix of the stack is as follows:
## expr_with_let_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 156, spurious reduction of production call_expr_level_in -> core_expr
## In state 174, spurious reduction of production option(type_annotation_simple) ->
## In state 175, spurious reduction of production call_expr_level -> call_expr_level_in option(type_annotation_simple)
## In state 176, spurious reduction of production unary_expr_level -> call_expr_level
## In state 129, spurious reduction of production mult_expr_level -> unary_expr_level
## In state 153, spurious reduction of production add_expr_level -> mult_expr_level
## In state 184, spurious reduction of production cat_expr_level -> add_expr_level
## In state 205, spurious reduction of production comp_expr_level -> cat_expr_level
## In state 212, spurious reduction of production conj_expr_level -> comp_expr_level
## In state 219, spurious reduction of production disj_expr_level -> conj_expr_level
## In state 166, spurious reduction of production base_expr -> disj_expr_level
## In state 223, spurious reduction of production base_cond -> base_expr
## In state 224, spurious reduction of production expr -> base_cond
## In state 401, spurious reduction of production expr_with_let_expr -> expr
##

<YOUR SYNTAX ERROR MESSAGE HERE>

interactive_expr: WILD WILD
##
## Ends in an error in state: 156.
##
## call_expr -> core_expr . LPAR nsepseq(expr,COMMA) RPAR [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
## call_expr -> core_expr . unit [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
## call_expr_level_in -> core_expr . [ VBAR Type TIMES SLASH SEMI RPAR RBRACKET RBRACE PLUS Or NE Mod MINUS Let LT LE GT GE EQEQ EOF COMMA COLON CAT BOOL_OR BOOL_AND Attr ARROW ]
##
## The known suffix of the stack is as follows:
## core_expr
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Attr WILD
##
## Ends in an error in state: 70.
##
## seq(Attr) -> Attr . seq(Attr) [ Let ]
##
## The known suffix of the stack is as follows:
## Attr
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let Ident COLON String WILD
##
## Ends in an error in state: 377.
##
## let_binding -> Ident option(type_annotation) . EQ expr [ Type SEMI Let EOF Attr ]
##
## The known suffix of the stack is as follows:
## Ident option(type_annotation)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let Ident EQ VBAR
##
## Ends in an error in state: 378.
##
## let_binding -> Ident option(type_annotation) EQ . expr [ Type SEMI Let EOF Attr ]
##
## The known suffix of the stack is as follows:
## Ident option(type_annotation) EQ
##

This is an incorrect let binding.
-
Examples of correct let bindings:
let a: int = 4;
let (a: int, b: int) = (1, 2);
let func = (a: int, b: int) => a + b;

contract: Let Ident WILD
##
## Ends in an error in state: 376.
##
## let_binding -> Ident . option(type_annotation) EQ expr [ Type SEMI Let EOF Attr ]
## sub_irrefutable -> Ident . [ COMMA ]
##
## The known suffix of the stack is as follows:
## Ident
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let LBRACE Ident EQ Bytes COMMA Ident EQ Bytes COMMA WILD
##
## Ends in an error in state: 312.
##
## nsepseq(field_pattern,COMMA) -> field_pattern COMMA . nsepseq(field_pattern,COMMA) [ RBRACE ]
## seq(__anonymous_0(field_pattern,COMMA)) -> field_pattern COMMA . seq(__anonymous_0(field_pattern,COMMA)) [ RBRACE ]
##
## The known suffix of the stack is as follows:
## field_pattern COMMA
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let LBRACE Ident EQ Bytes COMMA Ident EQ Bytes WILD
##
## Ends in an error in state: 311.
##
## nsepseq(field_pattern,COMMA) -> field_pattern . [ RBRACE ]
## nsepseq(field_pattern,COMMA) -> field_pattern . COMMA nsepseq(field_pattern,COMMA) [ RBRACE ]
## seq(__anonymous_0(field_pattern,COMMA)) -> field_pattern . COMMA seq(__anonymous_0(field_pattern,COMMA)) [ RBRACE ]
##
## The known suffix of the stack is as follows:
## field_pattern
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let LBRACE Ident EQ Bytes COMMA WILD
##
## Ends in an error in state: 308.
##
## nsepseq(field_pattern,COMMA) -> field_pattern COMMA . nsepseq(field_pattern,COMMA) [ RBRACE ]
## nseq(__anonymous_0(field_pattern,COMMA)) -> field_pattern COMMA . seq(__anonymous_0(field_pattern,COMMA)) [ RBRACE ]
##
## The known suffix of the stack is as follows:
## field_pattern COMMA
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let LBRACE Ident EQ Bytes RBRACE COLON String WILD
##
## Ends in an error in state: 390.
##
## let_binding -> record_pattern option(type_annotation) . EQ expr [ Type SEMI Let EOF Attr ]
##
## The known suffix of the stack is as follows:
## record_pattern option(type_annotation)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let LBRACE Ident EQ Bytes RBRACE EQ VBAR
##
## Ends in an error in state: 391.
##
## let_binding -> record_pattern option(type_annotation) EQ . expr [ Type SEMI Let EOF Attr ]
##
## The known suffix of the stack is as follows:
## record_pattern option(type_annotation) EQ
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let LBRACE Ident EQ Bytes RBRACE WILD
##
## Ends in an error in state: 389.
##
## let_binding -> record_pattern . option(type_annotation) EQ expr [ Type SEMI Let EOF Attr ]
## sub_irrefutable -> record_pattern . [ COMMA ]
##
## The known suffix of the stack is as follows:
## record_pattern
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let LBRACE Ident EQ Bytes WILD
##
## Ends in an error in state: 307.
##
## nsepseq(field_pattern,COMMA) -> field_pattern . [ RBRACE ]
## nsepseq(field_pattern,COMMA) -> field_pattern . COMMA nsepseq(field_pattern,COMMA) [ RBRACE ]
## nseq(__anonymous_0(field_pattern,COMMA)) -> field_pattern . COMMA seq(__anonymous_0(field_pattern,COMMA)) [ RBRACE ]
##
## The known suffix of the stack is as follows:
## field_pattern
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let LBRACE Ident EQ VBAR
##
## Ends in an error in state: 285.
##
## field_pattern -> Ident EQ . sub_pattern [ RBRACE COMMA ]
##
## The known suffix of the stack is as follows:
## Ident EQ
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let LBRACE Ident WILD
##
## Ends in an error in state: 284.
##
## field_pattern -> Ident . EQ sub_pattern [ RBRACE COMMA ]
##
## The known suffix of the stack is as follows:
## Ident
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let LBRACE WILD
##
## Ends in an error in state: 283.
##
## record_pattern -> LBRACE . sep_or_term_list(field_pattern,COMMA) RBRACE [ SEMI RPAR RBRACKET RBRACE EQ COMMA COLON ARROW ]
##
## The known suffix of the stack is as follows:
## LBRACE
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let LPAR C_Some VBAR
##
## Ends in an error in state: 290.
##
## constr_pattern -> C_Some . sub_pattern [ SEMI RPAR RBRACKET RBRACE COMMA ARROW ]
##
## The known suffix of the stack is as follows:
## C_Some
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let LPAR Constr LBRACKET VBAR
##
## Ends in an error in state: 282.
##
## list__(sub_pattern) -> LBRACKET . option(sep_or_term_list(sub_pattern,SEMI)) RBRACKET [ SEMI RPAR RBRACKET RBRACE COMMA ARROW ]
##
## The known suffix of the stack is as follows:
## LBRACKET
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let LPAR Constr LBRACKET WILD SEMI VBAR
##
## Ends in an error in state: 315.
##
## nsepseq(sub_pattern,SEMI) -> sub_pattern SEMI . nsepseq(sub_pattern,SEMI) [ RBRACKET ]
## nseq(__anonymous_0(sub_pattern,SEMI)) -> sub_pattern SEMI . seq(__anonymous_0(sub_pattern,SEMI)) [ RBRACKET ]
##
## The known suffix of the stack is as follows:
## sub_pattern SEMI
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let LPAR Constr LBRACKET WILD SEMI WILD SEMI VBAR
##
## Ends in an error in state: 317.
##
## nsepseq(sub_pattern,SEMI) -> sub_pattern SEMI . nsepseq(sub_pattern,SEMI) [ RBRACKET ]
## seq(__anonymous_0(sub_pattern,SEMI)) -> sub_pattern SEMI . seq(__anonymous_0(sub_pattern,SEMI)) [ RBRACKET ]
##
## The known suffix of the stack is as follows:
## sub_pattern SEMI
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let LPAR Constr LBRACKET WILD SEMI WILD WILD
##
## Ends in an error in state: 316.
##
## nsepseq(sub_pattern,SEMI) -> sub_pattern . [ RBRACKET ]
## nsepseq(sub_pattern,SEMI) -> sub_pattern . SEMI nsepseq(sub_pattern,SEMI) [ RBRACKET ]
## seq(__anonymous_0(sub_pattern,SEMI)) -> sub_pattern . SEMI seq(__anonymous_0(sub_pattern,SEMI)) [ RBRACKET ]
##
## The known suffix of the stack is as follows:
## sub_pattern
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let LPAR Constr LBRACKET WILD WILD
##
## Ends in an error in state: 314.
##
## nsepseq(sub_pattern,SEMI) -> sub_pattern . [ RBRACKET ]
## nsepseq(sub_pattern,SEMI) -> sub_pattern . SEMI nsepseq(sub_pattern,SEMI) [ RBRACKET ]
## nseq(__anonymous_0(sub_pattern,SEMI)) -> sub_pattern . SEMI seq(__anonymous_0(sub_pattern,SEMI)) [ RBRACKET ]
##
## The known suffix of the stack is as follows:
## sub_pattern
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let LPAR Constr LPAR VBAR
##
## Ends in an error in state: 281.
##
## par(ptuple) -> LPAR . ptuple RPAR [ SEMI RPAR RBRACKET RBRACE COMMA ARROW ]
## par(sub_pattern) -> LPAR . sub_pattern RPAR [ SEMI RPAR RBRACKET RBRACE COMMA ARROW ]
## unit -> LPAR . RPAR [ SEMI RPAR RBRACKET RBRACE COMMA ARROW ]
##
## The known suffix of the stack is as follows:
## LPAR
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let LPAR Constr LPAR WILD COMMA Bytes ARROW
##
## Ends in an error in state: 334.
##
## par(ptuple) -> LPAR ptuple . RPAR [ SEMI RPAR RBRACKET RBRACE COMMA ARROW ]
##
## The known suffix of the stack is as follows:
## LPAR ptuple
##
## 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 330, spurious reduction of production nsepseq(sub_pattern,COMMA) -> sub_pattern
## In state 333, spurious reduction of production tuple(sub_pattern) -> sub_pattern COMMA nsepseq(sub_pattern,COMMA)
## In state 326, spurious reduction of production ptuple -> tuple(sub_pattern)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let LPAR Constr LPAR WILD WILD
##
## Ends in an error in state: 327.
##
## par(sub_pattern) -> LPAR sub_pattern . RPAR [ SEMI RPAR RBRACKET RBRACE COMMA ARROW ]
## tuple(sub_pattern) -> sub_pattern . COMMA nsepseq(sub_pattern,COMMA) [ RPAR ]
##
## The known suffix of the stack is as follows:
## LPAR sub_pattern
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let LPAR Constr SEMI
##
## Ends in an error in state: 374.
##
## par(closed_irrefutable) -> LPAR closed_irrefutable . RPAR [ RPAR EQ COMMA COLON ]
##
## The known suffix of the stack is as follows:
## LPAR closed_irrefutable
##
## 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 289, spurious reduction of production constr_pattern -> Constr
## In state 373, spurious reduction of production closed_irrefutable -> constr_pattern
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let LPAR Constr VBAR
##
## Ends in an error in state: 289.
##
## constr_pattern -> Constr . sub_pattern [ SEMI RPAR RBRACKET RBRACE COMMA ARROW ]
## constr_pattern -> Constr . [ SEMI RPAR RBRACKET RBRACE COMMA ARROW ]
##
## The known suffix of the stack is as follows:
## Constr
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let LPAR RPAR COLON String WILD
##
## Ends in an error in state: 381.
##
## let_binding -> unit option(type_annotation) . EQ expr [ Type SEMI Let EOF Attr ]
##
## The known suffix of the stack is as follows:
## unit option(type_annotation)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let LPAR RPAR EQ VBAR
##
## Ends in an error in state: 382.
##
## let_binding -> unit option(type_annotation) EQ . expr [ Type SEMI Let EOF Attr ]
##
## The known suffix of the stack is as follows:
## unit option(type_annotation) EQ
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let LPAR RPAR WILD
##
## Ends in an error in state: 380.
##
## let_binding -> unit . option(type_annotation) EQ expr [ Type SEMI Let EOF Attr ]
## sub_irrefutable -> unit . [ COMMA ]
##
## The known suffix of the stack is as follows:
## unit
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let LPAR VBAR
##
## Ends in an error in state: 356.
##
## par(closed_irrefutable) -> LPAR . closed_irrefutable RPAR [ RPAR EQ COMMA COLON ]
## unit -> LPAR . RPAR [ RPAR EQ COMMA COLON ]
##
## The known suffix of the stack is as follows:
## LPAR
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let LPAR WILD COLON WILD
##
## Ends in an error in state: 371.
##
## typed_pattern -> irrefutable COLON . type_expr [ RPAR ]
##
## The known suffix of the stack is as follows:
## irrefutable COLON
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let LPAR WILD COMMA Ident EQ
##
## Ends in an error in state: 370.
##
## closed_irrefutable -> irrefutable . [ RPAR ]
## typed_pattern -> irrefutable . COLON type_expr [ RPAR ]
##
## The known suffix of the stack is as follows:
## irrefutable
##
## 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 364, spurious reduction of production nsepseq(sub_irrefutable,COMMA) -> sub_irrefutable
## In state 369, spurious reduction of production tuple(sub_irrefutable) -> sub_irrefutable COMMA nsepseq(sub_irrefutable,COMMA)
## In state 361, spurious reduction of production irrefutable -> tuple(sub_irrefutable)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let LPAR WILD RPAR COLON String WILD
##
## Ends in an error in state: 394.
##
## let_binding -> par(closed_irrefutable) option(type_annotation) . EQ expr [ Type SEMI Let EOF Attr ]
##
## The known suffix of the stack is as follows:
## par(closed_irrefutable) option(type_annotation)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let LPAR WILD RPAR EQ VBAR
##
## Ends in an error in state: 395.
##
## let_binding -> par(closed_irrefutable) option(type_annotation) EQ . expr [ Type SEMI Let EOF Attr ]
##
## The known suffix of the stack is as follows:
## par(closed_irrefutable) option(type_annotation) EQ
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let LPAR WILD RPAR WILD
##
## Ends in an error in state: 393.
##
## let_binding -> par(closed_irrefutable) . option(type_annotation) EQ expr [ Type SEMI Let EOF Attr ]
## sub_irrefutable -> par(closed_irrefutable) . [ COMMA ]
##
## The known suffix of the stack is as follows:
## par(closed_irrefutable)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let LPAR WILD WILD
##
## Ends in an error in state: 362.
##
## irrefutable -> sub_irrefutable . [ RPAR COLON ]
## tuple(sub_irrefutable) -> sub_irrefutable . COMMA nsepseq(sub_irrefutable,COMMA) [ RPAR COLON ]
##
## The known suffix of the stack is as follows:
## sub_irrefutable
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let Rec VBAR
##
## Ends in an error in state: 526.
##
## let_declaration -> seq(Attr) Let Rec . let_binding [ Type SEMI Let EOF Attr ]
##
## The known suffix of the stack is as follows:
## seq(Attr) Let Rec
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let VBAR
##
## Ends in an error in state: 76.
##
## let_declaration -> seq(Attr) Let . let_binding [ Type SEMI Let EOF Attr ]
## let_declaration -> seq(Attr) Let . Rec let_binding [ Type SEMI Let EOF Attr ]
##
## The known suffix of the stack is as follows:
## seq(Attr) Let
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let WILD COLON String WILD
##
## Ends in an error in state: 81.
##
## let_binding -> WILD option(type_annotation) . EQ expr [ Type SEMI Let EOF Attr ]
##
## The known suffix of the stack is as follows:
## WILD option(type_annotation)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let WILD COLON WILD
##
## Ends in an error in state: 78.
##
## type_annotation -> COLON . type_expr [ EQ ]
##
## The known suffix of the stack is as follows:
## COLON
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let WILD COMMA Ident COLON String WILD
##
## Ends in an error in state: 385.
##
## let_binding -> tuple(sub_irrefutable) option(type_annotation) . EQ expr [ Type SEMI Let EOF Attr ]
##
## The known suffix of the stack is as follows:
## tuple(sub_irrefutable) option(type_annotation)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let WILD COMMA Ident EQ VBAR
##
## Ends in an error in state: 386.
##
## let_binding -> tuple(sub_irrefutable) option(type_annotation) EQ . expr [ Type SEMI Let EOF Attr ]
##
## The known suffix of the stack is as follows:
## tuple(sub_irrefutable) option(type_annotation) EQ
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let WILD COMMA Ident RPAR
##
## Ends in an error in state: 384.
##
## let_binding -> tuple(sub_irrefutable) . option(type_annotation) EQ expr [ Type SEMI Let EOF Attr ]
##
## The known suffix of the stack is as follows:
## tuple(sub_irrefutable)
##
## 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 364, spurious reduction of production nsepseq(sub_irrefutable,COMMA) -> sub_irrefutable
## In state 369, spurious reduction of production tuple(sub_irrefutable) -> sub_irrefutable COMMA nsepseq(sub_irrefutable,COMMA)
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let WILD COMMA VBAR
##
## Ends in an error in state: 363.
##
## tuple(sub_irrefutable) -> sub_irrefutable COMMA . nsepseq(sub_irrefutable,COMMA) [ RPAR EQ COLON ]
##
## The known suffix of the stack is as follows:
## sub_irrefutable COMMA
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let WILD COMMA WILD COMMA VBAR
##
## Ends in an error in state: 365.
##
## nsepseq(sub_irrefutable,COMMA) -> sub_irrefutable COMMA . nsepseq(sub_irrefutable,COMMA) [ RPAR EQ COLON ]
##
## The known suffix of the stack is as follows:
## sub_irrefutable COMMA
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let WILD COMMA WILD WILD
##
## Ends in an error in state: 364.
##
## nsepseq(sub_irrefutable,COMMA) -> sub_irrefutable . [ RPAR EQ COLON ]
## nsepseq(sub_irrefutable,COMMA) -> sub_irrefutable . COMMA nsepseq(sub_irrefutable,COMMA) [ RPAR EQ COLON ]
##
## The known suffix of the stack is as follows:
## sub_irrefutable
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let WILD EQ Bytes VBAR
##
## Ends in an error in state: 529.
##
## declaration -> let_declaration . option(SEMI) [ Type Let EOF Attr ]
##
## The known suffix of the stack is as follows:
## let_declaration
##
## 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 156, spurious reduction of production call_expr_level_in -> core_expr
## In state 174, spurious reduction of production option(type_annotation_simple) ->
## In state 175, spurious reduction of production call_expr_level -> call_expr_level_in option(type_annotation_simple)
## In state 176, spurious reduction of production unary_expr_level -> call_expr_level
## In state 129, spurious reduction of production mult_expr_level -> unary_expr_level
## In state 153, spurious reduction of production add_expr_level -> mult_expr_level
## In state 184, spurious reduction of production cat_expr_level -> add_expr_level
## In state 205, spurious reduction of production comp_expr_level -> cat_expr_level
## In state 212, spurious reduction of production conj_expr_level -> comp_expr_level
## In state 219, spurious reduction of production disj_expr_level -> conj_expr_level
## In state 166, spurious reduction of production base_expr -> disj_expr_level
## In state 223, spurious reduction of production base_cond -> base_expr
## In state 224, spurious reduction of production expr -> base_cond
## In state 525, spurious reduction of production let_binding -> WILD option(type_annotation) EQ expr
## In state 528, spurious reduction of production let_declaration -> seq(Attr) Let let_binding
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let WILD EQ VBAR
##
## Ends in an error in state: 82.
##
## let_binding -> WILD option(type_annotation) EQ . expr [ Type SEMI Let EOF Attr ]
##
## The known suffix of the stack is as follows:
## WILD option(type_annotation) EQ
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Let WILD WILD
##
## Ends in an error in state: 77.
##
## let_binding -> WILD . option(type_annotation) EQ expr [ Type SEMI Let EOF Attr ]
## sub_irrefutable -> WILD . [ COMMA ]
##
## The known suffix of the stack is as follows:
## WILD
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident EQ Constr DOT WILD
##
## Ends in an error in state: 12.
##
## core_type -> Constr DOT . Ident [ Type SEMI RPAR RBRACE Let EQ EOF COMMA Attr ]
##
## The known suffix of the stack is as follows:
## Constr DOT
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident EQ Constr LPAR Ident RPAR WILD
##
## Ends in an error in state: 38.
##
## nsepseq(variant,VBAR) -> variant . [ Type SEMI RPAR RBRACE Let EQ EOF COMMA Attr ]
## nsepseq(variant,VBAR) -> variant . VBAR nsepseq(variant,VBAR) [ Type SEMI RPAR RBRACE Let EQ EOF COMMA Attr ]
##
## The known suffix of the stack is as follows:
## variant
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident EQ Constr LPAR String WILD
##
## Ends in an error in state: 36.
##
## variant -> Constr LPAR fun_type . RPAR [ VBAR Type SEMI RPAR RBRACE Let EQ EOF COMMA Attr ]
##
## The known suffix of the stack is as follows:
## Constr LPAR fun_type
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident EQ Constr LPAR WILD
##
## Ends in an error in state: 6.
##
## variant -> Constr LPAR . fun_type RPAR [ VBAR Type SEMI RPAR RBRACE Let EQ EOF COMMA Attr ]
##
## The known suffix of the stack is as follows:
## Constr LPAR
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident EQ Constr SEMI WILD
##
## Ends in an error in state: 533.
##
## declarations -> declaration . [ EOF ]
## declarations -> declaration . declarations [ EOF ]
##
## The known suffix of the stack is as follows:
## declaration
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident EQ Constr VBAR WILD
##
## Ends in an error in state: 39.
##
## nsepseq(variant,VBAR) -> variant VBAR . nsepseq(variant,VBAR) [ Type SEMI RPAR RBRACE Let EQ EOF COMMA Attr ]
##
## The known suffix of the stack is as follows:
## variant VBAR
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident EQ Constr WILD
##
## Ends in an error in state: 49.
##
## core_type -> Constr . DOT Ident [ Type SEMI RPAR RBRACE Let EQ EOF COMMA Attr ]
## variant -> Constr . [ VBAR Type SEMI RPAR RBRACE Let EQ EOF COMMA Attr ]
## variant -> Constr . LPAR fun_type RPAR [ VBAR Type SEMI RPAR RBRACE Let EQ EOF COMMA Attr ]
##
## The known suffix of the stack is as follows:
## Constr
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident EQ Ident ARROW WILD
##
## Ends in an error in state: 25.
##
## fun_type -> Ident ARROW . fun_type [ Type SEMI RPAR Let EQ EOF COMMA Attr ]
##
## The known suffix of the stack is as follows:
## Ident ARROW
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident EQ Ident LPAR String WILD
##
## Ends in an error in state: 18.
##
## tuple(fun_type) -> fun_type . COMMA nsepseq(fun_type,COMMA) [ RPAR ]
## type_args -> fun_type . [ RPAR ]
##
## The known suffix of the stack is as follows:
## fun_type
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident EQ Ident LPAR WILD
##
## Ends in an error in state: 10.
##
## par(type_args) -> LPAR . type_args RPAR [ Type SEMI RPAR RBRACE Let EQ EOF COMMA Attr ]
##
## The known suffix of the stack is as follows:
## LPAR
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident EQ Ident WILD
##
## Ends in an error in state: 9.
##
## core_type -> Ident . [ Type SEMI RPAR Let EQ EOF COMMA Attr ]
## core_type -> Ident . par(type_args) [ Type SEMI RPAR Let EQ EOF COMMA Attr ]
## fun_type -> Ident . ARROW fun_type [ Type SEMI RPAR Let EQ EOF COMMA Attr ]
##
## The known suffix of the stack is as follows:
## Ident
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident EQ LBRACE Ident COLON Ident WILD
##
## Ends in an error in state: 48.
##
## core_type -> Ident . [ RBRACE COMMA ]
## core_type -> Ident . par(type_args) [ RBRACE COMMA ]
##
## The known suffix of the stack is as follows:
## Ident
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident EQ LBRACE Ident COLON LPAR String WILD
##
## Ends in an error in state: 46.
##
## par(fun_type) -> LPAR fun_type . RPAR [ RBRACE COMMA ]
##
## The known suffix of the stack is as follows:
## LPAR fun_type
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident EQ LBRACE Ident COLON LPAR WILD
##
## Ends in an error in state: 45.
##
## par(fun_type) -> LPAR . fun_type RPAR [ RBRACE COMMA ]
##
## The known suffix of the stack is as follows:
## LPAR
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident EQ LBRACE Ident COLON String WILD
##
## Ends in an error in state: 59.
##
## nsepseq(field_decl,COMMA) -> field_decl . [ RBRACE ]
## nsepseq(field_decl,COMMA) -> field_decl . COMMA nsepseq(field_decl,COMMA) [ RBRACE ]
## nseq(__anonymous_0(field_decl,COMMA)) -> field_decl . COMMA seq(__anonymous_0(field_decl,COMMA)) [ RBRACE ]
##
## The known suffix of the stack is as follows:
## field_decl
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident EQ LBRACE Ident COLON WILD
##
## Ends in an error in state: 44.
##
## field_decl -> Ident COLON . type_expr_field [ RBRACE COMMA ]
##
## The known suffix of the stack is as follows:
## Ident COLON
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident EQ LBRACE Ident COMMA Ident COLON String WILD
##
## Ends in an error in state: 63.
##
## nsepseq(field_decl,COMMA) -> field_decl . [ RBRACE ]
## nsepseq(field_decl,COMMA) -> field_decl . COMMA nsepseq(field_decl,COMMA) [ RBRACE ]
## seq(__anonymous_0(field_decl,COMMA)) -> field_decl . COMMA seq(__anonymous_0(field_decl,COMMA)) [ RBRACE ]
##
## The known suffix of the stack is as follows:
## field_decl
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident EQ LBRACE Ident COMMA Ident COMMA WILD
##
## Ends in an error in state: 64.
##
## nsepseq(field_decl,COMMA) -> field_decl COMMA . nsepseq(field_decl,COMMA) [ RBRACE ]
## seq(__anonymous_0(field_decl,COMMA)) -> field_decl COMMA . seq(__anonymous_0(field_decl,COMMA)) [ RBRACE ]
##
## The known suffix of the stack is as follows:
## field_decl COMMA
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident EQ LBRACE Ident COMMA WILD
##
## Ends in an error in state: 60.
##
## nsepseq(field_decl,COMMA) -> field_decl COMMA . nsepseq(field_decl,COMMA) [ RBRACE ]
## nseq(__anonymous_0(field_decl,COMMA)) -> field_decl COMMA . seq(__anonymous_0(field_decl,COMMA)) [ RBRACE ]
##
## The known suffix of the stack is as follows:
## field_decl COMMA
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident EQ LBRACE Ident WILD
##
## Ends in an error in state: 43.
##
## field_decl -> Ident . [ RBRACE COMMA ]
## field_decl -> Ident . COLON type_expr_field [ RBRACE COMMA ]
##
## The known suffix of the stack is as follows:
## Ident
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident EQ LBRACE WILD
##
## Ends in an error in state: 42.
##
## record_type -> LBRACE . sep_or_term_list(field_decl,COMMA) RBRACE [ Type SEMI RPAR RBRACE Let EQ EOF COMMA Attr ]
##
## The known suffix of the stack is as follows:
## LBRACE
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident EQ LPAR Constr WILD
##
## Ends in an error in state: 11.
##
## core_type -> Constr . DOT Ident [ Type SEMI RPAR Let EQ EOF COMMA Attr ]
##
## The known suffix of the stack is as follows:
## Constr
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident EQ LPAR String COMMA Ident RPAR ARROW WILD
##
## Ends in an error in state: 30.
##
## fun_type -> LPAR tuple(fun_type) RPAR ARROW . fun_type [ Type SEMI RPAR Let EQ EOF COMMA Attr ]
##
## The known suffix of the stack is as follows:
## LPAR tuple(fun_type) RPAR ARROW
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident EQ LPAR String COMMA Ident RPAR WILD
##
## Ends in an error in state: 29.
##
## fun_type -> LPAR tuple(fun_type) RPAR . ARROW fun_type [ Type SEMI RPAR Let EQ EOF COMMA Attr ]
## fun_type -> LPAR tuple(fun_type) RPAR . [ Type SEMI RPAR Let EQ EOF COMMA Attr ]
##
## The known suffix of the stack is as follows:
## LPAR tuple(fun_type) RPAR
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident EQ LPAR String COMMA String COMMA WILD
##
## Ends in an error in state: 22.
##
## nsepseq(fun_type,COMMA) -> fun_type COMMA . nsepseq(fun_type,COMMA) [ RPAR ]
##
## The known suffix of the stack is as follows:
## fun_type COMMA
##

<YOUR SYNTAX ERROR MESSAGE HERE>

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

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident EQ LPAR String COMMA WILD
##
## Ends in an error in state: 19.
##
## tuple(fun_type) -> fun_type COMMA . nsepseq(fun_type,COMMA) [ RPAR ]
##
## The known suffix of the stack is as follows:
## fun_type COMMA
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident EQ LPAR String RPAR ARROW WILD
##
## Ends in an error in state: 34.
##
## fun_type -> LPAR fun_type RPAR ARROW . fun_type [ Type SEMI RPAR Let EQ EOF COMMA Attr ]
##
## The known suffix of the stack is as follows:
## LPAR fun_type RPAR ARROW
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident EQ LPAR String RPAR WILD
##
## Ends in an error in state: 33.
##
## fun_type -> LPAR fun_type RPAR . ARROW fun_type [ Type SEMI RPAR Let EQ EOF COMMA Attr ]
## par(fun_type) -> LPAR fun_type RPAR . [ Type SEMI RPAR Let EQ EOF COMMA Attr ]
##
## The known suffix of the stack is as follows:
## LPAR fun_type RPAR
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident EQ LPAR String WILD
##
## Ends in an error in state: 32.
##
## fun_type -> LPAR fun_type . RPAR ARROW fun_type [ Type SEMI RPAR Let EQ EOF COMMA Attr ]
## par(fun_type) -> LPAR fun_type . RPAR [ Type SEMI RPAR Let EQ EOF COMMA Attr ]
## tuple(fun_type) -> fun_type . COMMA nsepseq(fun_type,COMMA) [ RPAR ]
##
## The known suffix of the stack is as follows:
## LPAR fun_type
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident EQ LPAR WILD
##
## Ends in an error in state: 8.
##
## fun_type -> LPAR . fun_type RPAR ARROW fun_type [ Type SEMI RPAR Let EQ EOF COMMA Attr ]
## fun_type -> LPAR . tuple(fun_type) RPAR ARROW fun_type [ Type SEMI RPAR Let EQ EOF COMMA Attr ]
## fun_type -> LPAR . tuple(fun_type) RPAR [ Type SEMI RPAR Let EQ EOF COMMA Attr ]
## par(fun_type) -> LPAR . fun_type RPAR [ Type SEMI RPAR Let EQ EOF COMMA Attr ]
##
## The known suffix of the stack is as follows:
## LPAR
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident EQ String WILD
##
## Ends in an error in state: 72.
##
## declaration -> type_decl . option(SEMI) [ Type Let EOF Attr ]
##
## The known suffix of the stack is as follows:
## type_decl
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident EQ VBAR Constr WILD
##
## Ends in an error in state: 5.
##
## variant -> Constr . [ VBAR Type SEMI RPAR RBRACE Let EQ EOF COMMA Attr ]
## variant -> Constr . LPAR fun_type RPAR [ VBAR Type SEMI RPAR RBRACE Let EQ EOF COMMA Attr ]
##
## The known suffix of the stack is as follows:
## Constr
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident EQ VBAR WILD
##
## Ends in an error in state: 4.
##
## sum_type -> VBAR . nsepseq(variant,VBAR) [ Type SEMI RPAR RBRACE Let EQ EOF COMMA Attr ]
##
## The known suffix of the stack is as follows:
## VBAR
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident EQ WILD
##
## Ends in an error in state: 3.
##
## type_decl -> Type Ident EQ . type_expr [ Type SEMI Let EOF Attr ]
##
## The known suffix of the stack is as follows:
## Type Ident EQ
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type Ident WILD
##
## Ends in an error in state: 2.
##
## type_decl -> Type Ident . EQ type_expr [ Type SEMI Let EOF Attr ]
##
## The known suffix of the stack is as follows:
## Type Ident
##

<YOUR SYNTAX ERROR MESSAGE HERE>

contract: Type WILD
##
## Ends in an error in state: 1.
##
## type_decl -> Type . Ident EQ type_expr [ Type SEMI Let EOF Attr ]
##
## The known suffix of the stack is as follows:
## Type
##

<YOUR SYNTAX ERROR MESSAGE HERE>

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

<YOUR SYNTAX ERROR MESSAGE HERE>
