mirror of
https://github.com/CatalaLang/catala.git
synced 2024-11-08 07:51:43 +03:00
1840 lines
93 KiB
Plaintext
1840 lines
93 KiB
Plaintext
source_file: BEGIN_CODE DECLARATION ENUM CONSTRUCTOR COLON ALT CONSTRUCTOR CONTENT TEXT YEAR
|
|
##
|
|
## Ends in an error in state: 353.
|
|
##
|
|
## list(enum_decl_line) -> enum_decl_line . list(enum_decl_line) [ SCOPE END_CODE DECLARATION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## enum_decl_line
|
|
##
|
|
|
|
expected another enum case, or a new declaration or scope use
|
|
|
|
source_file: BEGIN_CODE DECLARATION ENUM CONSTRUCTOR COLON ALT CONSTRUCTOR CONTENT YEAR
|
|
##
|
|
## Ends in an error in state: 348.
|
|
##
|
|
## enum_decl_line_payload -> CONTENT . typ [ SCOPE END_CODE DECLARATION ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## CONTENT
|
|
##
|
|
|
|
expected a content type
|
|
|
|
source_file: BEGIN_CODE DECLARATION ENUM CONSTRUCTOR COLON ALT CONSTRUCTOR YEAR
|
|
##
|
|
## Ends in an error in state: 347.
|
|
##
|
|
## enum_decl_line -> ALT constructor . option(enum_decl_line_payload) [ SCOPE END_CODE DECLARATION ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## ALT constructor
|
|
##
|
|
|
|
expected a payload for your enum case, or another case or declaration
|
|
|
|
source_file: BEGIN_CODE DECLARATION ENUM CONSTRUCTOR COLON ALT YEAR
|
|
##
|
|
## Ends in an error in state: 346.
|
|
##
|
|
## enum_decl_line -> ALT . constructor option(enum_decl_line_payload) [ SCOPE END_CODE DECLARATION ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## ALT
|
|
##
|
|
|
|
expected the name of an enum case
|
|
|
|
source_file: BEGIN_CODE DECLARATION ENUM CONSTRUCTOR COLON YEAR
|
|
##
|
|
## Ends in an error in state: 345.
|
|
##
|
|
## code_item -> DECLARATION ENUM constructor COLON . list(enum_decl_line) [ SCOPE END_CODE DECLARATION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## DECLARATION ENUM constructor COLON
|
|
##
|
|
|
|
expected an enum case
|
|
|
|
source_file: BEGIN_CODE DECLARATION ENUM CONSTRUCTOR YEAR
|
|
##
|
|
## Ends in an error in state: 344.
|
|
##
|
|
## code_item -> DECLARATION ENUM constructor . COLON list(enum_decl_line) [ SCOPE END_CODE DECLARATION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## DECLARATION ENUM constructor
|
|
##
|
|
|
|
expected a colon
|
|
|
|
source_file: BEGIN_CODE DECLARATION ENUM YEAR
|
|
##
|
|
## Ends in an error in state: 343.
|
|
##
|
|
## code_item -> DECLARATION ENUM . constructor COLON list(enum_decl_line) [ SCOPE END_CODE DECLARATION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## DECLARATION ENUM
|
|
##
|
|
|
|
expected the name of your enum
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
source_file: BEGIN_CODE DECLARATION SCOPE CONSTRUCTOR COLON YEAR
|
|
##
|
|
## Ends in an error in state: 318.
|
|
##
|
|
## code_item -> DECLARATION SCOPE constructor COLON . nonempty_list(scope_decl_item) [ SCOPE END_CODE DECLARATION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## DECLARATION SCOPE constructor COLON
|
|
##
|
|
|
|
expected a context item introduced by "context"
|
|
|
|
source_file: BEGIN_CODE DECLARATION SCOPE CONSTRUCTOR YEAR
|
|
##
|
|
## Ends in an error in state: 317.
|
|
##
|
|
## code_item -> DECLARATION SCOPE constructor . COLON nonempty_list(scope_decl_item) [ SCOPE END_CODE DECLARATION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## DECLARATION SCOPE constructor
|
|
##
|
|
|
|
expected a colon followed by the list of context items of this scope
|
|
|
|
source_file: BEGIN_CODE DECLARATION SCOPE YEAR
|
|
##
|
|
## Ends in an error in state: 316.
|
|
##
|
|
## code_item -> DECLARATION SCOPE . constructor COLON nonempty_list(scope_decl_item) [ SCOPE END_CODE DECLARATION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## DECLARATION SCOPE
|
|
##
|
|
|
|
expected the name of the scope you are declaring
|
|
|
|
source_file: BEGIN_CODE DECLARATION STRUCT CONSTRUCTOR COLON CONDITION IDENT DEPENDS COLLECTION YEAR
|
|
##
|
|
## Ends in an error in state: 303.
|
|
##
|
|
## typ -> collection_marked . typ [ STATE SCOPE OUTPUT INTERNAL INPUT IDENT END_CODE DEPENDS DECLARATION DATA CONTEXT CONDITION ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## collection_marked
|
|
##
|
|
|
|
expected a new struct data, or another declaration or scope use
|
|
|
|
source_file: BEGIN_CODE DECLARATION STRUCT CONSTRUCTOR COLON CONDITION IDENT DEPENDS TEXT YEAR
|
|
##
|
|
## Ends in an error in state: 311.
|
|
##
|
|
## list(struct_scope) -> struct_scope . list(struct_scope) [ SCOPE END_CODE DECLARATION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## struct_scope
|
|
##
|
|
|
|
expected a new struct data, or another declaration or scope use
|
|
|
|
source_file: BEGIN_CODE DECLARATION STRUCT CONSTRUCTOR COLON CONDITION IDENT DEPENDS YEAR
|
|
##
|
|
## Ends in an error in state: 307.
|
|
##
|
|
## struct_scope_func -> DEPENDS . typ [ STATE SCOPE OUTPUT INTERNAL INPUT IDENT END_CODE DECLARATION DATA CONTEXT CONDITION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## DEPENDS
|
|
##
|
|
|
|
expected the type of the parameter of this struct data function
|
|
|
|
source_file: BEGIN_CODE DECLARATION STRUCT CONSTRUCTOR COLON CONDITION IDENT YEAR
|
|
##
|
|
## Ends in an error in state: 306.
|
|
##
|
|
## struct_scope -> struct_scope_base . option(struct_scope_func) [ SCOPE END_CODE DECLARATION DATA CONDITION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## struct_scope_base
|
|
##
|
|
|
|
expected a new struct data, or another declaration or scope use
|
|
|
|
source_file: BEGIN_CODE DECLARATION STRUCT CONSTRUCTOR COLON CONDITION YEAR
|
|
##
|
|
## Ends in an error in state: 313.
|
|
##
|
|
## struct_scope_base -> condition_pos . ident [ SCOPE END_CODE DEPENDS DECLARATION DATA CONDITION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## condition_pos
|
|
##
|
|
|
|
expected the name of this struct condition
|
|
|
|
source_file: BEGIN_CODE DECLARATION STRUCT CONSTRUCTOR COLON DATA IDENT CONTENT YEAR
|
|
##
|
|
## Ends in an error in state: 299.
|
|
##
|
|
## struct_scope_base -> DATA ident CONTENT . typ [ SCOPE END_CODE DEPENDS DECLARATION DATA CONDITION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## DATA ident CONTENT
|
|
##
|
|
|
|
expected the type of this struct data
|
|
|
|
source_file: BEGIN_CODE DECLARATION STRUCT CONSTRUCTOR COLON DATA IDENT YEAR
|
|
##
|
|
## Ends in an error in state: 298.
|
|
##
|
|
## struct_scope_base -> DATA ident . CONTENT typ [ SCOPE END_CODE DEPENDS DECLARATION DATA CONDITION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## DATA ident
|
|
##
|
|
|
|
expected the type of this struct data, introduced by the content keyword
|
|
|
|
source_file: BEGIN_CODE DECLARATION STRUCT CONSTRUCTOR COLON DATA YEAR
|
|
##
|
|
## Ends in an error in state: 297.
|
|
##
|
|
## struct_scope_base -> DATA . ident CONTENT typ [ SCOPE END_CODE DEPENDS DECLARATION DATA CONDITION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## DATA
|
|
##
|
|
|
|
expected the name of this struct data
|
|
|
|
source_file: BEGIN_CODE DECLARATION STRUCT CONSTRUCTOR COLON YEAR
|
|
##
|
|
## Ends in an error in state: 296.
|
|
##
|
|
## code_item -> DECLARATION STRUCT constructor COLON . list(struct_scope) [ SCOPE END_CODE DECLARATION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## DECLARATION STRUCT constructor COLON
|
|
##
|
|
|
|
expected struct data or condition
|
|
|
|
source_file: BEGIN_CODE DECLARATION STRUCT CONSTRUCTOR YEAR
|
|
##
|
|
## Ends in an error in state: 295.
|
|
##
|
|
## code_item -> DECLARATION STRUCT constructor . COLON list(struct_scope) [ SCOPE END_CODE DECLARATION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## DECLARATION STRUCT constructor
|
|
##
|
|
|
|
expected a colon
|
|
|
|
source_file: BEGIN_CODE DECLARATION STRUCT YEAR
|
|
##
|
|
## Ends in an error in state: 294.
|
|
##
|
|
## code_item -> DECLARATION STRUCT . constructor COLON list(struct_scope) [ SCOPE END_CODE DECLARATION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## DECLARATION STRUCT
|
|
##
|
|
|
|
expected the struct name
|
|
|
|
source_file: BEGIN_CODE DECLARATION YEAR
|
|
##
|
|
## Ends in an error in state: 293.
|
|
##
|
|
## code_item -> DECLARATION . STRUCT constructor COLON list(struct_scope) [ SCOPE END_CODE DECLARATION ]
|
|
## code_item -> DECLARATION . SCOPE constructor COLON nonempty_list(scope_decl_item) [ SCOPE END_CODE DECLARATION ]
|
|
## code_item -> DECLARATION . ENUM constructor COLON list(enum_decl_line) [ SCOPE END_CODE DECLARATION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## DECLARATION
|
|
##
|
|
|
|
expected the kind of the declaration (struct, scope or enum)
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR COLON ASSERTION CARDINAL THEN
|
|
##
|
|
## Ends in an error in state: 258.
|
|
##
|
|
## nonempty_list(scope_item) -> scope_item . [ SCOPE END_CODE DECLARATION ]
|
|
## nonempty_list(scope_item) -> scope_item . nonempty_list(scope_item) [ SCOPE END_CODE DECLARATION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## scope_item
|
|
##
|
|
## 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 81, spurious reduction of production primitive_expression -> CARDINAL
|
|
## In state 85, spurious reduction of production base_expression -> primitive_expression
|
|
## In state 111, spurious reduction of production unop_expression -> base_expression
|
|
## In state 82, spurious reduction of production mult_expression -> unop_expression
|
|
## In state 159, spurious reduction of production sum_expression -> mult_expression
|
|
## In state 112, spurious reduction of production compare_expression -> sum_expression
|
|
## In state 170, spurious reduction of production logical_atom -> compare_expression
|
|
## In state 165, spurious reduction of production logical_or_expression -> logical_atom
|
|
## In state 161, spurious reduction of production logical_expression -> logical_or_expression
|
|
## In state 195, spurious reduction of production expression -> logical_expression
|
|
## In state 252, spurious reduction of production assertion_base -> expression
|
|
## In state 253, spurious reduction of production assertion -> option(condition_consequence) assertion_base
|
|
## In state 257, spurious reduction of production scope_item -> ASSERTION assertion
|
|
##
|
|
|
|
expected a new scope use item
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR COLON ASSERTION FIXED IDENT BY YEAR
|
|
##
|
|
## Ends in an error in state: 249.
|
|
##
|
|
## assertion -> FIXED qident BY . ident [ SCOPE RULE LABEL EXCEPTION END_CODE DEFINITION DECLARATION ASSERTION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## FIXED qident BY
|
|
##
|
|
|
|
expected the legislative text by which the value of the variable is fixed
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR COLON ASSERTION FIXED IDENT WITH_V
|
|
##
|
|
## Ends in an error in state: 248.
|
|
##
|
|
## assertion -> FIXED qident . BY ident [ SCOPE RULE LABEL EXCEPTION END_CODE DEFINITION DECLARATION ASSERTION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## FIXED qident
|
|
##
|
|
## 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 242, spurious reduction of production separated_nonempty_list(DOT,ident) -> ident
|
|
## In state 234, spurious reduction of production qident -> separated_nonempty_list(DOT,ident)
|
|
##
|
|
|
|
expected the legislative text by which the value of the variable is fixed
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR COLON ASSERTION FIXED YEAR
|
|
##
|
|
## Ends in an error in state: 247.
|
|
##
|
|
## assertion -> FIXED . qident BY ident [ SCOPE RULE LABEL EXCEPTION END_CODE DEFINITION DECLARATION ASSERTION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## FIXED
|
|
##
|
|
|
|
expected the name of the variable that should be fixed
|
|
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR COLON ASSERTION UNDER_CONDITION TRUE THEN
|
|
##
|
|
## Ends in an error in state: 255.
|
|
##
|
|
## condition_consequence -> condition . CONSEQUENCE [ VERTICAL TRUE SUM STATE NOT MONEY_AMOUNT MINUSMONEY MINUSDURATION MINUSDEC MINUS MINIMUM MAXIMUM MATCH MAP LSQUARE LPAREN INT_LITERAL IF IDENT FOR FILTER FILLED FALSE EXISTS DEFINED_AS DECIMAL_LITERAL CONTENT CONSTRUCTOR CARDINAL ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## condition
|
|
##
|
|
## 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 46, spurious reduction of production primitive_expression -> small_expression
|
|
## In state 85, spurious reduction of production base_expression -> primitive_expression
|
|
## In state 111, spurious reduction of production unop_expression -> base_expression
|
|
## In state 82, spurious reduction of production mult_expression -> unop_expression
|
|
## In state 159, spurious reduction of production sum_expression -> mult_expression
|
|
## In state 112, spurious reduction of production compare_expression -> sum_expression
|
|
## In state 170, spurious reduction of production logical_atom -> compare_expression
|
|
## In state 165, spurious reduction of production logical_or_expression -> logical_atom
|
|
## In state 161, spurious reduction of production logical_expression -> logical_or_expression
|
|
## In state 195, spurious reduction of production expression -> logical_expression
|
|
## In state 246, spurious reduction of production condition -> UNDER_CONDITION expression
|
|
##
|
|
|
|
expected a consequence for this definition under condition
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR COLON ASSERTION UNDER_CONDITION YEAR
|
|
##
|
|
## Ends in an error in state: 245.
|
|
##
|
|
## condition -> UNDER_CONDITION . expression [ CONSEQUENCE ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## UNDER_CONDITION
|
|
##
|
|
|
|
expected an expression for this condition
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR COLON ASSERTION VARIES IDENT UNDER_CONDITION
|
|
##
|
|
## Ends in an error in state: 235.
|
|
##
|
|
## assertion -> VARIES qident . WITH_V base_expression option(variation_type) [ SCOPE RULE LABEL EXCEPTION END_CODE DEFINITION DECLARATION ASSERTION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## VARIES qident
|
|
##
|
|
## 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 242, spurious reduction of production separated_nonempty_list(DOT,ident) -> ident
|
|
## In state 234, spurious reduction of production qident -> separated_nonempty_list(DOT,ident)
|
|
##
|
|
|
|
expected an indication about what this variable varies with
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR COLON ASSERTION VARIES IDENT WITH_V TRUE XOR
|
|
##
|
|
## Ends in an error in state: 237.
|
|
##
|
|
## assertion -> VARIES qident WITH_V base_expression . option(variation_type) [ SCOPE RULE LABEL EXCEPTION END_CODE DEFINITION DECLARATION ASSERTION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## VARIES qident WITH_V base_expression
|
|
##
|
|
## 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 46, spurious reduction of production primitive_expression -> small_expression
|
|
## In state 85, spurious reduction of production base_expression -> primitive_expression
|
|
##
|
|
|
|
expected an indication about the variation sense of the variable, or a new scope item
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR COLON ASSERTION VARIES IDENT WITH_V YEAR
|
|
##
|
|
## Ends in an error in state: 236.
|
|
##
|
|
## assertion -> VARIES qident WITH_V . base_expression option(variation_type) [ SCOPE RULE LABEL EXCEPTION END_CODE DEFINITION DECLARATION ASSERTION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## VARIES qident WITH_V
|
|
##
|
|
|
|
the variable varies with an expression that was expected here
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR COLON ASSERTION VARIES YEAR
|
|
##
|
|
## Ends in an error in state: 233.
|
|
##
|
|
## assertion -> VARIES . qident WITH_V base_expression option(variation_type) [ SCOPE RULE LABEL EXCEPTION END_CODE DEFINITION DECLARATION ASSERTION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## VARIES
|
|
##
|
|
|
|
expecting the name of the varying variable
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR COLON ASSERTION YEAR
|
|
##
|
|
## Ends in an error in state: 232.
|
|
##
|
|
## scope_item -> ASSERTION . assertion [ SCOPE RULE LABEL EXCEPTION END_CODE DEFINITION DECLARATION ASSERTION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## ASSERTION
|
|
##
|
|
|
|
expected an expression that shoud be asserted during execution
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR COLON DEFINITION IDENT DEFINED_AS YEAR
|
|
##
|
|
## Ends in an error in state: 286.
|
|
##
|
|
## definition -> option(label) option(exception_to) DEFINITION qident option(definition_parameters) option(state) option(condition_consequence) DEFINED_AS . expression [ SCOPE RULE LABEL EXCEPTION END_CODE DEFINITION DECLARATION ASSERTION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## option(label) option(exception_to) DEFINITION qident option(definition_parameters) option(state) option(condition_consequence) DEFINED_AS
|
|
##
|
|
|
|
expected an expression for the definition
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR COLON DEFINITION IDENT OF IDENT DECREASING
|
|
##
|
|
## Ends in an error in state: 283.
|
|
##
|
|
## definition -> option(label) option(exception_to) DEFINITION qident option(definition_parameters) . option(state) option(condition_consequence) DEFINED_AS expression [ SCOPE RULE LABEL EXCEPTION END_CODE DEFINITION DECLARATION ASSERTION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## option(label) option(exception_to) DEFINITION qident option(definition_parameters)
|
|
##
|
|
|
|
expected a expression for defining this function, introduced by the defined as keyword
|
|
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR COLON DEFINITION IDENT WITH_V
|
|
##
|
|
## Ends in an error in state: 282.
|
|
##
|
|
## definition -> option(label) option(exception_to) DEFINITION qident . option(definition_parameters) option(state) option(condition_consequence) DEFINED_AS expression [ SCOPE RULE LABEL EXCEPTION END_CODE DEFINITION DECLARATION ASSERTION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## option(label) option(exception_to) DEFINITION qident
|
|
##
|
|
## 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 242, spurious reduction of production separated_nonempty_list(DOT,ident) -> ident
|
|
## In state 234, spurious reduction of production qident -> separated_nonempty_list(DOT,ident)
|
|
##
|
|
|
|
expected the defined as keyword to introduce the definition of this variable
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR COLON DEFINITION YEAR
|
|
##
|
|
## Ends in an error in state: 281.
|
|
##
|
|
## definition -> option(label) option(exception_to) DEFINITION . qident option(definition_parameters) option(state) option(condition_consequence) DEFINED_AS expression [ SCOPE RULE LABEL EXCEPTION END_CODE DEFINITION DECLARATION ASSERTION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## option(label) option(exception_to) DEFINITION
|
|
##
|
|
|
|
expected the name of the variable you want to define
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR COLON EXCEPTION IDENT YEAR
|
|
##
|
|
## Ends in an error in state: 264.
|
|
##
|
|
## definition -> option(label) option(exception_to) . DEFINITION qident option(definition_parameters) option(state) option(condition_consequence) DEFINED_AS expression [ SCOPE RULE LABEL EXCEPTION END_CODE DEFINITION DECLARATION ASSERTION ]
|
|
## rule -> option(label) option(exception_to) . RULE rule_expr option(condition_consequence) option(state) rule_consequence [ SCOPE RULE LABEL EXCEPTION END_CODE DEFINITION DECLARATION ASSERTION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## option(label) option(exception_to)
|
|
##
|
|
|
|
expected a rule or a definition after the exception declaration
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR COLON EXCEPTION YEAR
|
|
##
|
|
## Ends in an error in state: 261.
|
|
##
|
|
## exception_to -> EXCEPTION . option(ident) [ RULE DEFINITION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## EXCEPTION
|
|
##
|
|
|
|
expected the label to which the exception is referring back
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR COLON LABEL IDENT DEFINED_AS
|
|
##
|
|
## Ends in an error in state: 260.
|
|
##
|
|
## definition -> option(label) . option(exception_to) DEFINITION qident option(definition_parameters) option(state) option(condition_consequence) DEFINED_AS expression [ SCOPE RULE LABEL EXCEPTION END_CODE DEFINITION DECLARATION ASSERTION ]
|
|
## rule -> option(label) . option(exception_to) RULE rule_expr option(condition_consequence) option(state) rule_consequence [ SCOPE RULE LABEL EXCEPTION END_CODE DEFINITION DECLARATION ASSERTION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## option(label)
|
|
##
|
|
|
|
expected a rule or a definition after the label declaration
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR COLON LABEL YEAR
|
|
##
|
|
## Ends in an error in state: 230.
|
|
##
|
|
## label -> LABEL . ident [ RULE EXCEPTION DEFINITION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## LABEL
|
|
##
|
|
|
|
expected the name of the label
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR COLON RULE IDENT DOT YEAR
|
|
##
|
|
## Ends in an error in state: 243.
|
|
##
|
|
## separated_nonempty_list(DOT,ident) -> ident DOT . separated_nonempty_list(DOT,ident) [ WITH_V UNDER_CONDITION STATE OF NOT FILLED DEFINED_AS BY ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## ident DOT
|
|
##
|
|
|
|
expected a struct field or a sub-scope context item after the dot
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR COLON RULE IDENT NOT FALSE
|
|
##
|
|
## Ends in an error in state: 274.
|
|
##
|
|
## rule_consequence -> option(NOT) . FILLED [ SCOPE RULE LABEL EXCEPTION END_CODE DEFINITION DECLARATION ASSERTION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## option(NOT)
|
|
##
|
|
|
|
expected the filled keyword the this rule
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR COLON RULE IDENT OF IDENT YEAR
|
|
##
|
|
## Ends in an error in state: 266.
|
|
##
|
|
## rule -> option(label) option(exception_to) RULE rule_expr . option(condition_consequence) option(state) rule_consequence [ SCOPE RULE LABEL EXCEPTION END_CODE DEFINITION DECLARATION ASSERTION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## option(label) option(exception_to) RULE rule_expr
|
|
##
|
|
|
|
expected the expression of the rule
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR COLON RULE IDENT OF YEAR
|
|
##
|
|
## Ends in an error in state: 277.
|
|
##
|
|
## definition_parameters -> OF . ident [ UNDER_CONDITION STATE NOT FILLED DEFINED_AS ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## OF
|
|
##
|
|
|
|
expected the name of the parameter for this dependent variable
|
|
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR COLON RULE IDENT WITH_V
|
|
##
|
|
## Ends in an error in state: 276.
|
|
##
|
|
## rule_expr -> qident . option(definition_parameters) [ UNDER_CONDITION STATE NOT FILLED ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## qident
|
|
##
|
|
## 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 242, spurious reduction of production separated_nonempty_list(DOT,ident) -> ident
|
|
## In state 234, spurious reduction of production qident -> separated_nonempty_list(DOT,ident)
|
|
##
|
|
|
|
expected a condition or a consequence for this rule
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR COLON RULE IDENT YEAR
|
|
##
|
|
## Ends in an error in state: 242.
|
|
##
|
|
## separated_nonempty_list(DOT,ident) -> ident . [ WITH_V UNDER_CONDITION STATE OF NOT FILLED DEFINED_AS BY ]
|
|
## separated_nonempty_list(DOT,ident) -> ident . DOT separated_nonempty_list(DOT,ident) [ WITH_V UNDER_CONDITION STATE OF NOT FILLED DEFINED_AS BY ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## ident
|
|
##
|
|
|
|
expected a condition or a consequence for this rule, or the rest of the variable qualified name
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR COLON RULE YEAR
|
|
##
|
|
## Ends in an error in state: 265.
|
|
##
|
|
## rule -> option(label) option(exception_to) RULE . rule_expr option(condition_consequence) option(state) rule_consequence [ SCOPE RULE LABEL EXCEPTION END_CODE DEFINITION DECLARATION ASSERTION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## option(label) option(exception_to) RULE
|
|
##
|
|
|
|
expected the name of the variable subject to the rule
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR COLON YEAR
|
|
##
|
|
## Ends in an error in state: 229.
|
|
##
|
|
## code_item -> SCOPE constructor option(scope_use_condition) COLON . nonempty_list(scope_item) [ SCOPE END_CODE DECLARATION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## SCOPE constructor option(scope_use_condition) COLON
|
|
##
|
|
|
|
expected a scope use item: a rule, definition or assertion
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION CARDINAL YEAR
|
|
##
|
|
## Ends in an error in state: 81.
|
|
##
|
|
## aggregate_func -> CARDINAL . [ FOR ]
|
|
## primitive_expression -> CARDINAL . [ XOR WITH THEN SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR OF NOT_EQUAL MULTMONEY MULTDEC MULT MULDURATION MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL INCREASING GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER EXCEPTION EQUAL END_CODE ELSE DIVMONEY DIVDURATION DIVDEC DIV DEFINITION DECREASING DECLARATION CONTAINS CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## CARDINAL
|
|
##
|
|
|
|
expected the keyword following cardinal to compute the number of elements in a set
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION CONSTRUCTOR CONTENT TRUE YEAR
|
|
##
|
|
## Ends in an error in state: 177.
|
|
##
|
|
## enum_inject_content -> CONTENT small_expression . [ XOR WITH WE_HAVE THEN SUCH SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR OF NOT_EQUAL MULTMONEY MULTDEC MULT MULDURATION MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL INCREASING GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER FOR EXCEPTION EQUAL END_CODE ELSE DIVMONEY DIVDURATION DIVDEC DIV DEFINITION DECREASING DECLARATION CONTAINS CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
## small_expression -> small_expression . DOT option(terminated(constructor,DOT)) ident [ XOR WITH WE_HAVE THEN SUCH SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR OF NOT_EQUAL MULTMONEY MULTDEC MULT MULDURATION MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL INCREASING GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER FOR EXCEPTION EQUAL END_CODE ELSE DOT DIVMONEY DIVDURATION DIVDEC DIV DEFINITION DECREASING DECLARATION CONTAINS CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## CONTENT small_expression
|
|
##
|
|
|
|
the expression for the content of the enum case is already well-formed, expected an operator to form a bigger expression
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION CONSTRUCTOR CONTENT YEAR
|
|
##
|
|
## Ends in an error in state: 176.
|
|
##
|
|
## enum_inject_content -> CONTENT . small_expression [ XOR WITH WE_HAVE THEN SUCH SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR OF NOT_EQUAL MULTMONEY MULTDEC MULT MULDURATION MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL INCREASING GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER FOR EXCEPTION EQUAL END_CODE ELSE DIVMONEY DIVDURATION DIVDEC DIV DEFINITION DECREASING DECLARATION CONTAINS CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## CONTENT
|
|
##
|
|
|
|
expected an expression for the content of this enum case
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION CONSTRUCTOR DOT CONSTRUCTOR ALL
|
|
##
|
|
## Ends in an error in state: 175.
|
|
##
|
|
## struct_or_enum_inject -> constructor option(preceded(DOT,constructor)) . option(enum_inject_content) [ XOR WITH WE_HAVE THEN SUCH SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR OF NOT_EQUAL MULTMONEY MULTDEC MULT MULDURATION MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL INCREASING GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER FOR EXCEPTION EQUAL END_CODE ELSE DIVMONEY DIVDURATION DIVDEC DIV DEFINITION DECREASING DECLARATION CONTAINS CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## constructor option(preceded(DOT,constructor))
|
|
##
|
|
|
|
expected the rest of the path, or the content of the enum constructor
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION CONSTRUCTOR DOT YEAR
|
|
##
|
|
## Ends in an error in state: 92.
|
|
##
|
|
## option(preceded(DOT,constructor)) -> DOT . constructor [ XOR WITH WE_HAVE THEN SUCH SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR OF NOT_EQUAL MULTMONEY MULTDEC MULT MULDURATION MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL INCREASING GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER FOR EXCEPTION EQUAL END_CODE ELSE DIVMONEY DIVDURATION DIVDEC DIV DEFINITION DECREASING DECLARATION CONTENT CONTAINS CONSTRUCTOR CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## DOT
|
|
##
|
|
|
|
expected the rest of the path after the dot
|
|
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION CONSTRUCTOR LBRACKET ALT IDENT COLON CARDINAL THEN
|
|
##
|
|
## Ends in an error in state: 76.
|
|
##
|
|
## separated_nonempty_list(ALT,struct_content_field) -> struct_content_field . [ RBRACKET ]
|
|
## separated_nonempty_list(ALT,struct_content_field) -> struct_content_field . ALT separated_nonempty_list(ALT,struct_content_field) [ RBRACKET ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## struct_content_field
|
|
##
|
|
## 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 81, spurious reduction of production primitive_expression -> CARDINAL
|
|
## In state 85, spurious reduction of production base_expression -> primitive_expression
|
|
## In state 111, spurious reduction of production unop_expression -> base_expression
|
|
## In state 82, spurious reduction of production mult_expression -> unop_expression
|
|
## In state 159, spurious reduction of production sum_expression -> mult_expression
|
|
## In state 112, spurious reduction of production compare_expression -> sum_expression
|
|
## In state 170, spurious reduction of production logical_atom -> compare_expression
|
|
## In state 165, spurious reduction of production logical_or_expression -> logical_atom
|
|
## In state 161, spurious reduction of production logical_expression -> logical_or_expression
|
|
## In state 171, spurious reduction of production struct_content_field -> ident COLON logical_expression
|
|
##
|
|
|
|
expected another structure field or the closing bracket
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION CONSTRUCTOR LBRACKET ALT IDENT COLON YEAR
|
|
##
|
|
## Ends in an error in state: 80.
|
|
##
|
|
## struct_content_field -> ident COLON . logical_expression [ RBRACKET ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## ident COLON
|
|
##
|
|
|
|
expected the expression for this struct field
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION CONSTRUCTOR LBRACKET ALT IDENT YEAR
|
|
##
|
|
## Ends in an error in state: 79.
|
|
##
|
|
## struct_content_field -> ident . COLON logical_expression [ RBRACKET ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## ident
|
|
##
|
|
|
|
expected a colon
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION CONSTRUCTOR LBRACKET ALT YEAR
|
|
##
|
|
## Ends in an error in state: 75.
|
|
##
|
|
## struct_inject_content -> LBRACKET ALT . separated_nonempty_list(ALT,struct_content_field) RBRACKET [ XOR WITH WE_HAVE THEN SUCH SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR OF NOT_EQUAL MULTMONEY MULTDEC MULT MULDURATION MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL INCREASING GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER FOR EXCEPTION EQUAL END_CODE ELSE DIVMONEY DIVDURATION DIVDEC DIV DEFINITION DECREASING DECLARATION CONTAINS CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## LBRACKET ALT
|
|
##
|
|
|
|
expected the name of the structure field
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION CONSTRUCTOR LBRACKET YEAR
|
|
##
|
|
## Ends in an error in state: 74.
|
|
##
|
|
## struct_inject_content -> LBRACKET . ALT separated_nonempty_list(ALT,struct_content_field) RBRACKET [ XOR WITH WE_HAVE THEN SUCH SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR OF NOT_EQUAL MULTMONEY MULTDEC MULT MULDURATION MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL INCREASING GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER FOR EXCEPTION EQUAL END_CODE ELSE DIVMONEY DIVDURATION DIVDEC DIV DEFINITION DECREASING DECLARATION CONTAINS CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## LBRACKET
|
|
##
|
|
|
|
expected structure fields introduced by --
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION CONSTRUCTOR YEAR
|
|
##
|
|
## Ends in an error in state: 73.
|
|
##
|
|
## struct_or_enum_inject -> constructor . option(preceded(DOT,constructor)) option(enum_inject_content) [ XOR WITH WE_HAVE THEN SUCH SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR OF NOT_EQUAL MULTMONEY MULTDEC MULT MULDURATION MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL INCREASING GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER FOR EXCEPTION EQUAL END_CODE ELSE DIVMONEY DIVDURATION DIVDEC DIV DEFINITION DECREASING DECLARATION CONTAINS CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
## struct_or_enum_inject -> constructor . struct_inject_content [ XOR WITH WE_HAVE THEN SUCH SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR OF NOT_EQUAL MULTMONEY MULTDEC MULT MULDURATION MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL INCREASING GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER FOR EXCEPTION EQUAL END_CODE ELSE DIVMONEY DIVDURATION DIVDEC DIV DEFINITION DECREASING DECLARATION CONTAINS CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## constructor
|
|
##
|
|
|
|
expected a payload for the enum case constructor, or the rest of the expression (with an operator ?)
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION CONTENT MAXIMUM TEXT INIT YEAR
|
|
##
|
|
## Ends in an error in state: 182.
|
|
##
|
|
## aggregate_func -> CONTENT MAXIMUM typ_base INIT . primitive_expression [ FOR ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## CONTENT MAXIMUM typ_base INIT
|
|
##
|
|
|
|
expected the initial expression for the maximum
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION CONTENT MAXIMUM TEXT YEAR
|
|
##
|
|
## Ends in an error in state: 181.
|
|
##
|
|
## aggregate_func -> CONTENT MAXIMUM typ_base . INIT primitive_expression [ FOR ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## CONTENT MAXIMUM typ_base
|
|
##
|
|
|
|
expected the "initial" keyword introducing the initial expression for the maximum
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION CONTENT MAXIMUM YEAR
|
|
##
|
|
## Ends in an error in state: 180.
|
|
##
|
|
## aggregate_func -> CONTENT MAXIMUM . typ_base INIT primitive_expression [ FOR ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## CONTENT MAXIMUM
|
|
##
|
|
|
|
expected the type of the elements compared to get the maximum
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION CONTENT MINIMUM TEXT INIT YEAR
|
|
##
|
|
## Ends in an error in state: 63.
|
|
##
|
|
## aggregate_func -> CONTENT MINIMUM typ_base INIT . primitive_expression [ FOR ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## CONTENT MINIMUM typ_base INIT
|
|
##
|
|
|
|
expected the initial expression for the minimum
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION CONTENT MINIMUM TEXT YEAR
|
|
##
|
|
## Ends in an error in state: 62.
|
|
##
|
|
## aggregate_func -> CONTENT MINIMUM typ_base . INIT primitive_expression [ FOR ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## CONTENT MINIMUM typ_base
|
|
##
|
|
|
|
expected the "initial" keyword introducing the initial expression for the minimum
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION CONTENT MINIMUM YEAR
|
|
##
|
|
## Ends in an error in state: 61.
|
|
##
|
|
## aggregate_func -> CONTENT MINIMUM . typ_base INIT primitive_expression [ FOR ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## CONTENT MINIMUM
|
|
##
|
|
|
|
expected the type of the elements compared to get the minimum
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION CONTENT YEAR
|
|
##
|
|
## Ends in an error in state: 60.
|
|
##
|
|
## aggregate_func -> CONTENT . MAXIMUM typ_base INIT primitive_expression [ FOR ]
|
|
## aggregate_func -> CONTENT . MINIMUM typ_base INIT primitive_expression [ FOR ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## CONTENT
|
|
##
|
|
|
|
this is the start of an arg-maximum or arg-minimum expression
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION EXISTS IDENT IN CARDINAL SUCH THAT YEAR
|
|
##
|
|
## Ends in an error in state: 203.
|
|
##
|
|
## expression -> exists_prefix . expression [ THEN SEMICOLON SCOPE RULE RSQUARE RPAREN LABEL EXCEPTION END_CODE ELSE DEFINITION DECLARATION CONSEQUENCE COLON ASSERTION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## exists_prefix
|
|
##
|
|
|
|
expected an expression for the existential test
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION EXISTS IDENT IN TRUE SUCH YEAR
|
|
##
|
|
## Ends in an error in state: 209.
|
|
##
|
|
## exists_prefix -> exists_marked ident IN primitive_expression SUCH . THAT [ VERTICAL TRUE SUM NOT MONEY_AMOUNT MINUSMONEY MINUSDURATION MINUSDEC MINUS MINIMUM MAXIMUM MATCH MAP LSQUARE LPAREN INT_LITERAL IF IDENT FOR FILTER FALSE EXISTS DECIMAL_LITERAL CONTENT CONSTRUCTOR CARDINAL ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## exists_marked ident IN primitive_expression SUCH
|
|
##
|
|
|
|
expected a keyword to complete the "such that" construction
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION EXISTS IDENT IN TRUE XOR
|
|
##
|
|
## Ends in an error in state: 208.
|
|
##
|
|
## exists_prefix -> exists_marked ident IN primitive_expression . SUCH THAT [ VERTICAL TRUE SUM NOT MONEY_AMOUNT MINUSMONEY MINUSDURATION MINUSDEC MINUS MINIMUM MAXIMUM MATCH MAP LSQUARE LPAREN INT_LITERAL IF IDENT FOR FILTER FALSE EXISTS DECIMAL_LITERAL CONTENT CONSTRUCTOR CARDINAL ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## exists_marked ident IN primitive_expression
|
|
##
|
|
## 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 46, spurious reduction of production primitive_expression -> small_expression
|
|
##
|
|
|
|
expected a keyword to form the "such that" expression for the existential test
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION EXISTS IDENT IN YEAR
|
|
##
|
|
## Ends in an error in state: 207.
|
|
##
|
|
## exists_prefix -> exists_marked ident IN . primitive_expression SUCH THAT [ VERTICAL TRUE SUM NOT MONEY_AMOUNT MINUSMONEY MINUSDURATION MINUSDEC MINUS MINIMUM MAXIMUM MATCH MAP LSQUARE LPAREN INT_LITERAL IF IDENT FOR FILTER FALSE EXISTS DECIMAL_LITERAL CONTENT CONSTRUCTOR CARDINAL ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## exists_marked ident IN
|
|
##
|
|
|
|
expected an expression that designates the set subject to the existential test
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION EXISTS IDENT YEAR
|
|
##
|
|
## Ends in an error in state: 206.
|
|
##
|
|
## exists_prefix -> exists_marked ident . IN primitive_expression SUCH THAT [ VERTICAL TRUE SUM NOT MONEY_AMOUNT MINUSMONEY MINUSDURATION MINUSDEC MINUS MINIMUM MAXIMUM MATCH MAP LSQUARE LPAREN INT_LITERAL IF IDENT FOR FILTER FALSE EXISTS DECIMAL_LITERAL CONTENT CONSTRUCTOR CARDINAL ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## exists_marked ident
|
|
##
|
|
|
|
expected the "in" keyword to continue this existential test
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION EXISTS YEAR
|
|
##
|
|
## Ends in an error in state: 205.
|
|
##
|
|
## exists_prefix -> exists_marked . ident IN primitive_expression SUCH THAT [ VERTICAL TRUE SUM NOT MONEY_AMOUNT MINUSMONEY MINUSDURATION MINUSDEC MINUS MINIMUM MAXIMUM MATCH MAP LSQUARE LPAREN INT_LITERAL IF IDENT FOR FILTER FALSE EXISTS DECIMAL_LITERAL CONTENT CONSTRUCTOR CARDINAL ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## exists_marked
|
|
##
|
|
|
|
expected an identifier that will designate the existential witness for the test
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION FOR ALL IDENT IN CARDINAL WE_HAVE YEAR
|
|
##
|
|
## Ends in an error in state: 196.
|
|
##
|
|
## expression -> forall_prefix . expression [ THEN SEMICOLON SCOPE RULE RSQUARE RPAREN LABEL EXCEPTION END_CODE ELSE DEFINITION DECLARATION CONSEQUENCE COLON ASSERTION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## forall_prefix
|
|
##
|
|
|
|
expected an expression for the universal test
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION FOR ALL IDENT IN TRUE XOR
|
|
##
|
|
## Ends in an error in state: 200.
|
|
##
|
|
## forall_prefix -> for_all_marked ident IN primitive_expression . WE_HAVE [ VERTICAL TRUE SUM NOT MONEY_AMOUNT MINUSMONEY MINUSDURATION MINUSDEC MINUS MINIMUM MAXIMUM MATCH MAP LSQUARE LPAREN INT_LITERAL IF IDENT FOR FILTER FALSE EXISTS DECIMAL_LITERAL CONTENT CONSTRUCTOR CARDINAL ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## for_all_marked ident IN primitive_expression
|
|
##
|
|
## 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 46, spurious reduction of production primitive_expression -> small_expression
|
|
##
|
|
|
|
expected the "we have" keyword for this universal test
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION FOR ALL IDENT IN YEAR
|
|
##
|
|
## Ends in an error in state: 199.
|
|
##
|
|
## forall_prefix -> for_all_marked ident IN . primitive_expression WE_HAVE [ VERTICAL TRUE SUM NOT MONEY_AMOUNT MINUSMONEY MINUSDURATION MINUSDEC MINUS MINIMUM MAXIMUM MATCH MAP LSQUARE LPAREN INT_LITERAL IF IDENT FOR FILTER FALSE EXISTS DECIMAL_LITERAL CONTENT CONSTRUCTOR CARDINAL ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## for_all_marked ident IN
|
|
##
|
|
|
|
expected the expression designating the set on which to perform the universal test
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION FOR ALL IDENT YEAR
|
|
##
|
|
## Ends in an error in state: 198.
|
|
##
|
|
## forall_prefix -> for_all_marked ident . IN primitive_expression WE_HAVE [ VERTICAL TRUE SUM NOT MONEY_AMOUNT MINUSMONEY MINUSDURATION MINUSDEC MINUS MINIMUM MAXIMUM MATCH MAP LSQUARE LPAREN INT_LITERAL IF IDENT FOR FILTER FALSE EXISTS DECIMAL_LITERAL CONTENT CONSTRUCTOR CARDINAL ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## for_all_marked ident
|
|
##
|
|
|
|
expected the "in" keyword for the rest of the universal test
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION FOR ALL YEAR
|
|
##
|
|
## Ends in an error in state: 197.
|
|
##
|
|
## forall_prefix -> for_all_marked . ident IN primitive_expression WE_HAVE [ VERTICAL TRUE SUM NOT MONEY_AMOUNT MINUSMONEY MINUSDURATION MINUSDEC MINUS MINIMUM MAXIMUM MATCH MAP LSQUARE LPAREN INT_LITERAL IF IDENT FOR FILTER FALSE EXISTS DECIMAL_LITERAL CONTENT CONSTRUCTOR CARDINAL ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## for_all_marked
|
|
##
|
|
|
|
expected an identifier for the bound variable of the universal test
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION FOR YEAR
|
|
##
|
|
## Ends in an error in state: 192.
|
|
##
|
|
## for_all_marked -> FOR . ALL [ IDENT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## FOR
|
|
##
|
|
|
|
expected the "all" keyword to mean the "for all" construction of the universal test
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION IF TRUE SEMICOLON
|
|
##
|
|
## Ends in an error in state: 211.
|
|
##
|
|
## expression -> IF expression . THEN expression ELSE expression [ THEN SEMICOLON SCOPE RULE RSQUARE RPAREN LABEL EXCEPTION END_CODE ELSE DEFINITION DECLARATION CONSEQUENCE COLON ASSERTION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## IF expression
|
|
##
|
|
## 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 46, spurious reduction of production primitive_expression -> small_expression
|
|
## In state 85, spurious reduction of production base_expression -> primitive_expression
|
|
## In state 111, spurious reduction of production unop_expression -> base_expression
|
|
## In state 82, spurious reduction of production mult_expression -> unop_expression
|
|
## In state 159, spurious reduction of production sum_expression -> mult_expression
|
|
## In state 112, spurious reduction of production compare_expression -> sum_expression
|
|
## In state 170, spurious reduction of production logical_atom -> compare_expression
|
|
## In state 165, spurious reduction of production logical_or_expression -> logical_atom
|
|
## In state 161, spurious reduction of production logical_expression -> logical_or_expression
|
|
## In state 195, spurious reduction of production expression -> logical_expression
|
|
##
|
|
|
|
expected the "then" keyword as the conditional expression is complete
|
|
|
|
|
|
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION IF YEAR
|
|
##
|
|
## Ends in an error in state: 191.
|
|
##
|
|
## expression -> IF . expression THEN expression ELSE expression [ THEN SEMICOLON SCOPE RULE RSQUARE RPAREN LABEL EXCEPTION END_CODE ELSE DEFINITION DECLARATION CONSEQUENCE COLON ASSERTION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## IF
|
|
##
|
|
|
|
expected an expression for the test of the conditional
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION INT_LITERAL WITH_V
|
|
##
|
|
## Ends in an error in state: 65.
|
|
##
|
|
## literal -> num_literal . option(unit_literal) [ XOR WITH WE_HAVE THEN SUCH SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR OF NOT_EQUAL MULTMONEY MULTDEC MULT MULDURATION MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL INCREASING GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER FOR EXCEPTION EQUAL END_CODE ELSE DOT DIVMONEY DIVDURATION DIVDEC DIV DEFINITION DECREASING DECLARATION CONTAINS CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## num_literal
|
|
##
|
|
|
|
expected a unit for this literal, or a valid operator to complete the expression
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION LPAREN TRUE THEN
|
|
##
|
|
## Ends in an error in state: 216.
|
|
##
|
|
## atomic_expression -> LPAREN expression . RPAREN [ XOR WITH WE_HAVE THEN SUCH SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR OF NOT_EQUAL MULTMONEY MULTDEC MULT MULDURATION MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL INCREASING GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER FOR EXCEPTION EQUAL END_CODE ELSE DOT DIVMONEY DIVDURATION DIVDEC DIV DEFINITION DECREASING DECLARATION CONTAINS CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## LPAREN expression
|
|
##
|
|
## 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 46, spurious reduction of production primitive_expression -> small_expression
|
|
## In state 85, spurious reduction of production base_expression -> primitive_expression
|
|
## In state 111, spurious reduction of production unop_expression -> base_expression
|
|
## In state 82, spurious reduction of production mult_expression -> unop_expression
|
|
## In state 159, spurious reduction of production sum_expression -> mult_expression
|
|
## In state 112, spurious reduction of production compare_expression -> sum_expression
|
|
## In state 170, spurious reduction of production logical_atom -> compare_expression
|
|
## In state 165, spurious reduction of production logical_or_expression -> logical_atom
|
|
## In state 161, spurious reduction of production logical_expression -> logical_or_expression
|
|
## In state 195, spurious reduction of production expression -> logical_expression
|
|
##
|
|
|
|
unmatched parenthesis that should have been closed by here
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION LPAREN YEAR
|
|
##
|
|
## Ends in an error in state: 38.
|
|
##
|
|
## atomic_expression -> LPAREN . expression RPAREN [ XOR WITH WE_HAVE THEN SUCH SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR OF NOT_EQUAL MULTMONEY MULTDEC MULT MULDURATION MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL INCREASING GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER FOR EXCEPTION EQUAL END_CODE ELSE DOT DIVMONEY DIVDURATION DIVDEC DIV DEFINITION DECREASING DECLARATION CONTAINS CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## LPAREN
|
|
##
|
|
|
|
expected an expression inside the parenthesis
|
|
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION LSQUARE TRUE THEN
|
|
##
|
|
## Ends in an error in state: 222.
|
|
##
|
|
## separated_nonempty_list(SEMICOLON,expression) -> expression . [ RSQUARE ]
|
|
## separated_nonempty_list(SEMICOLON,expression) -> expression . SEMICOLON separated_nonempty_list(SEMICOLON,expression) [ RSQUARE ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## expression
|
|
##
|
|
## 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 46, spurious reduction of production primitive_expression -> small_expression
|
|
## In state 85, spurious reduction of production base_expression -> primitive_expression
|
|
## In state 111, spurious reduction of production unop_expression -> base_expression
|
|
## In state 82, spurious reduction of production mult_expression -> unop_expression
|
|
## In state 159, spurious reduction of production sum_expression -> mult_expression
|
|
## In state 112, spurious reduction of production compare_expression -> sum_expression
|
|
## In state 170, spurious reduction of production logical_atom -> compare_expression
|
|
## In state 165, spurious reduction of production logical_or_expression -> logical_atom
|
|
## In state 161, spurious reduction of production logical_expression -> logical_or_expression
|
|
## In state 195, spurious reduction of production expression -> logical_expression
|
|
##
|
|
|
|
expected a semicolon or a right square bracket after the collection element
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION LSQUARE YEAR
|
|
##
|
|
## Ends in an error in state: 34.
|
|
##
|
|
## primitive_expression -> LSQUARE . loption(separated_nonempty_list(SEMICOLON,expression)) RSQUARE [ XOR WITH WE_HAVE THEN SUCH SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR OF NOT_EQUAL MULTMONEY MULTDEC MULT MULDURATION MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL INCREASING GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER FOR EXCEPTION EQUAL END_CODE ELSE DIVMONEY DIVDURATION DIVDEC DIV DEFINITION DECREASING DECLARATION CONTAINS CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## LSQUARE
|
|
##
|
|
|
|
expected a collection element
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION MAP FOR IDENT IN TRUE OF YEAR
|
|
##
|
|
## Ends in an error in state: 106.
|
|
##
|
|
## aggregate -> aggregate_func FOR ident IN primitive_expression OF . base_expression [ XOR THEN SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR NOT_EQUAL MULTMONEY MULTDEC MULT MULDURATION MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL INCREASING GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER EXCEPTION EQUAL END_CODE ELSE DIVMONEY DIVDURATION DIVDEC DIV DEFINITION DECREASING DECLARATION CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## aggregate_func FOR ident IN primitive_expression OF
|
|
##
|
|
|
|
expected an expression for the map predicate
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION MAP FOR IDENT IN TRUE XOR
|
|
##
|
|
## Ends in an error in state: 105.
|
|
##
|
|
## aggregate -> aggregate_func FOR ident IN primitive_expression . OF base_expression [ XOR THEN SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR NOT_EQUAL MULTMONEY MULTDEC MULT MULDURATION MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL INCREASING GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER EXCEPTION EQUAL END_CODE ELSE DIVMONEY DIVDURATION DIVDEC DIV DEFINITION DECREASING DECLARATION CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## aggregate_func FOR ident IN primitive_expression
|
|
##
|
|
## 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 46, spurious reduction of production primitive_expression -> small_expression
|
|
##
|
|
|
|
expected the "of" keyword to introduce the map predicate
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION MAP FOR IDENT IN YEAR
|
|
##
|
|
## Ends in an error in state: 104.
|
|
##
|
|
## aggregate -> aggregate_func FOR ident IN . primitive_expression OF base_expression [ XOR THEN SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR NOT_EQUAL MULTMONEY MULTDEC MULT MULDURATION MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL INCREASING GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER EXCEPTION EQUAL END_CODE ELSE DIVMONEY DIVDURATION DIVDEC DIV DEFINITION DECREASING DECLARATION CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## aggregate_func FOR ident IN
|
|
##
|
|
|
|
expected the collection argument to map
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION MAP FOR IDENT YEAR
|
|
##
|
|
## Ends in an error in state: 103.
|
|
##
|
|
## aggregate -> aggregate_func FOR ident . IN primitive_expression OF base_expression [ XOR THEN SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR NOT_EQUAL MULTMONEY MULTDEC MULT MULDURATION MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL INCREASING GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER EXCEPTION EQUAL END_CODE ELSE DIVMONEY DIVDURATION DIVDEC DIV DEFINITION DECREASING DECLARATION CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## aggregate_func FOR ident
|
|
##
|
|
|
|
expected the "in" keyword to introduce the collection argument to map
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION MAP FOR YEAR
|
|
##
|
|
## Ends in an error in state: 102.
|
|
##
|
|
## aggregate -> aggregate_func FOR . ident IN primitive_expression OF base_expression [ XOR THEN SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR NOT_EQUAL MULTMONEY MULTDEC MULT MULDURATION MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL INCREASING GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER EXCEPTION EQUAL END_CODE ELSE DIVMONEY DIVDURATION DIVDEC DIV DEFINITION DECREASING DECLARATION CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## aggregate_func FOR
|
|
##
|
|
|
|
expected the identifier for the map predicate
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION MAP YEAR
|
|
##
|
|
## Ends in an error in state: 101.
|
|
##
|
|
## aggregate -> aggregate_func . FOR ident IN primitive_expression OF base_expression [ XOR THEN SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR NOT_EQUAL MULTMONEY MULTDEC MULT MULDURATION MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL INCREASING GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER EXCEPTION EQUAL END_CODE ELSE DIVMONEY DIVDURATION DIVDEC DIV DEFINITION DECREASING DECLARATION CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## aggregate_func
|
|
##
|
|
|
|
expected the "for" keyword to introduce the identifier for the map predicate
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION MATCH TRUE WITH ALT CONSTRUCTOR COLON CARDINAL RBRACKET
|
|
##
|
|
## Ends in an error in state: 185.
|
|
##
|
|
## match_arms -> ALT match_arm . match_arms [ THEN SEMICOLON SCOPE RULE RSQUARE RPAREN LABEL EXCEPTION END_CODE ELSE DEFINITION DECLARATION CONSEQUENCE COLON ASSERTION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## ALT match_arm
|
|
##
|
|
## 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 81, spurious reduction of production primitive_expression -> CARDINAL
|
|
## In state 85, spurious reduction of production base_expression -> primitive_expression
|
|
## In state 111, spurious reduction of production unop_expression -> base_expression
|
|
## In state 82, spurious reduction of production mult_expression -> unop_expression
|
|
## In state 159, spurious reduction of production sum_expression -> mult_expression
|
|
## In state 112, spurious reduction of production compare_expression -> sum_expression
|
|
## In state 170, spurious reduction of production logical_atom -> compare_expression
|
|
## In state 165, spurious reduction of production logical_or_expression -> logical_atom
|
|
## In state 161, spurious reduction of production logical_expression -> logical_or_expression
|
|
## In state 189, spurious reduction of production match_arm -> constructor_binding COLON logical_expression
|
|
##
|
|
|
|
expected the "with pattern" keyword to complete the pattern matching expression
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION MATCH TRUE WITH ALT CONSTRUCTOR COLON YEAR
|
|
##
|
|
## Ends in an error in state: 188.
|
|
##
|
|
## match_arm -> constructor_binding COLON . logical_expression [ THEN SEMICOLON SCOPE RULE RSQUARE RPAREN LABEL EXCEPTION END_CODE ELSE DEFINITION DECLARATION CONSEQUENCE COLON ASSERTION ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## constructor_binding COLON
|
|
##
|
|
|
|
expected a correct expression for this match arm
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION MATCH TRUE WITH ALT CONSTRUCTOR XOR
|
|
##
|
|
## Ends in an error in state: 187.
|
|
##
|
|
## match_arm -> constructor_binding . COLON logical_expression [ THEN SEMICOLON SCOPE RULE RSQUARE RPAREN LABEL EXCEPTION END_CODE ELSE DEFINITION DECLARATION CONSEQUENCE COLON ASSERTION ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## constructor_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 91, spurious reduction of production option(preceded(DOT,constructor)) ->
|
|
## In state 94, spurious reduction of production maybe_qualified_constructor -> constructor option(preceded(DOT,constructor))
|
|
## In state 87, spurious reduction of production optional_binding ->
|
|
## In state 96, spurious reduction of production constructor_binding -> maybe_qualified_constructor optional_binding
|
|
##
|
|
|
|
expected a constructor payload binding or a colon
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION MATCH TRUE WITH ALT YEAR
|
|
##
|
|
## Ends in an error in state: 55.
|
|
##
|
|
## match_arms -> ALT . match_arm match_arms [ THEN SEMICOLON SCOPE RULE RSQUARE RPAREN LABEL EXCEPTION END_CODE ELSE DEFINITION DECLARATION CONSEQUENCE COLON ASSERTION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## ALT
|
|
##
|
|
|
|
expected the name of the constructor for the enum case in the pattern matching
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION MATCH TRUE WITH YEAR
|
|
##
|
|
## Ends in an error in state: 54.
|
|
##
|
|
## expression -> MATCH primitive_expression WITH . match_arms [ THEN SEMICOLON SCOPE RULE RSQUARE RPAREN LABEL EXCEPTION END_CODE ELSE DEFINITION DECLARATION CONSEQUENCE COLON ASSERTION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## MATCH primitive_expression WITH
|
|
##
|
|
|
|
expected a pattern matching case
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION MATCH TRUE XOR
|
|
##
|
|
## Ends in an error in state: 53.
|
|
##
|
|
## expression -> MATCH primitive_expression . WITH match_arms [ THEN SEMICOLON SCOPE RULE RSQUARE RPAREN LABEL EXCEPTION END_CODE ELSE DEFINITION DECLARATION CONSEQUENCE COLON ASSERTION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## MATCH primitive_expression
|
|
##
|
|
## 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 46, spurious reduction of production primitive_expression -> small_expression
|
|
##
|
|
|
|
expected the "with pattern" keyword
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION MATCH YEAR
|
|
##
|
|
## Ends in an error in state: 39.
|
|
##
|
|
## expression -> MATCH . primitive_expression WITH match_arms [ THEN SEMICOLON SCOPE RULE RSQUARE RPAREN LABEL EXCEPTION END_CODE ELSE DEFINITION DECLARATION CONSEQUENCE COLON ASSERTION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## MATCH
|
|
##
|
|
|
|
expected an expression to match with
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION MAXIMUM TEXT INIT YEAR
|
|
##
|
|
## Ends in an error in state: 37.
|
|
##
|
|
## aggregate_func -> MAXIMUM typ_base INIT . primitive_expression [ FOR ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## MAXIMUM typ_base INIT
|
|
##
|
|
|
|
expected the maximum initial expression
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION MAXIMUM TEXT YEAR
|
|
##
|
|
## Ends in an error in state: 36.
|
|
##
|
|
## aggregate_func -> MAXIMUM typ_base . INIT primitive_expression [ FOR ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## MAXIMUM typ_base
|
|
##
|
|
|
|
expected the "initial" keyword to introduce the maximum initial expression
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION MAXIMUM YEAR
|
|
##
|
|
## Ends in an error in state: 35.
|
|
##
|
|
## aggregate_func -> MAXIMUM . typ_base INIT primitive_expression [ FOR ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## MAXIMUM
|
|
##
|
|
|
|
expected the type of the elements compared for the maximum
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION MINIMUM TEXT INIT YEAR
|
|
##
|
|
## Ends in an error in state: 33.
|
|
##
|
|
## aggregate_func -> MINIMUM typ_base INIT . primitive_expression [ FOR ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## MINIMUM typ_base INIT
|
|
##
|
|
|
|
expected the minimum initial expression
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION MINIMUM TEXT YEAR
|
|
##
|
|
## Ends in an error in state: 32.
|
|
##
|
|
## aggregate_func -> MINIMUM typ_base . INIT primitive_expression [ FOR ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## MINIMUM typ_base
|
|
##
|
|
|
|
expected the "initial" keyword to introduce the minimum initial expression
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION MINIMUM YEAR
|
|
##
|
|
## Ends in an error in state: 31.
|
|
##
|
|
## aggregate_func -> MINIMUM . typ_base INIT primitive_expression [ FOR ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## MINIMUM
|
|
##
|
|
|
|
expected the type of the elements compared for the minimum
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION MINUSMONEY YEAR
|
|
##
|
|
## Ends in an error in state: 83.
|
|
##
|
|
## unop_expression -> unop . unop_expression [ XOR THEN SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR NOT_EQUAL MULTMONEY MULTDEC MULT MULDURATION MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER EXCEPTION EQUAL END_CODE ELSE DIVMONEY DIVDURATION DIVDEC DIV DEFINITION DECLARATION CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## unop
|
|
##
|
|
|
|
expected an expression to take the opposite of
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION SUM YEAR
|
|
##
|
|
## Ends in an error in state: 15.
|
|
##
|
|
## aggregate_func -> SUM . typ_base [ FOR ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## SUM
|
|
##
|
|
|
|
expected the "for" keyword to spell the aggregation
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION TRUE ASSERTION
|
|
##
|
|
## Ends in an error in state: 228.
|
|
##
|
|
## code_item -> SCOPE constructor option(scope_use_condition) . COLON nonempty_list(scope_item) [ SCOPE END_CODE DECLARATION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## SCOPE constructor option(scope_use_condition)
|
|
##
|
|
## 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 46, spurious reduction of production primitive_expression -> small_expression
|
|
## In state 85, spurious reduction of production base_expression -> primitive_expression
|
|
## In state 111, spurious reduction of production unop_expression -> base_expression
|
|
## In state 82, spurious reduction of production mult_expression -> unop_expression
|
|
## In state 159, spurious reduction of production sum_expression -> mult_expression
|
|
## In state 112, spurious reduction of production compare_expression -> sum_expression
|
|
## In state 170, spurious reduction of production logical_atom -> compare_expression
|
|
## In state 165, spurious reduction of production logical_or_expression -> logical_atom
|
|
## In state 161, spurious reduction of production logical_expression -> logical_or_expression
|
|
## In state 195, spurious reduction of production expression -> logical_expression
|
|
## In state 226, spurious reduction of production scope_use_condition -> UNDER_CONDITION expression
|
|
## In state 227, spurious reduction of production option(scope_use_condition) -> scope_use_condition
|
|
##
|
|
|
|
expected a colon after the scope use precondition
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION TRUE DOT CONSTRUCTOR DOT YEAR
|
|
##
|
|
## Ends in an error in state: 48.
|
|
##
|
|
## small_expression -> small_expression DOT option(terminated(constructor,DOT)) . ident [ XOR WITH WE_HAVE THEN SUCH SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR OF NOT_EQUAL MULTMONEY MULTDEC MULT MULDURATION MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL INCREASING GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER FOR EXCEPTION EQUAL END_CODE ELSE DOT DIVMONEY DIVDURATION DIVDEC DIV DEFINITION DECREASING DECLARATION CONTAINS CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## small_expression DOT option(terminated(constructor,DOT))
|
|
##
|
|
|
|
expected the rest of the path after the dot
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION TRUE DOT CONSTRUCTOR YEAR
|
|
##
|
|
## Ends in an error in state: 51.
|
|
##
|
|
## option(terminated(constructor,DOT)) -> constructor . DOT [ IDENT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## constructor
|
|
##
|
|
|
|
expected the rest of the path after a dot
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION TRUE DOT YEAR
|
|
##
|
|
## Ends in an error in state: 47.
|
|
##
|
|
## small_expression -> small_expression DOT . option(terminated(constructor,DOT)) ident [ XOR WITH WE_HAVE THEN SUCH SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR OF NOT_EQUAL MULTMONEY MULTDEC MULT MULDURATION MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL INCREASING GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER FOR EXCEPTION EQUAL END_CODE ELSE DOT DIVMONEY DIVDURATION DIVDEC DIV DEFINITION DECREASING DECLARATION CONTAINS CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## small_expression DOT
|
|
##
|
|
|
|
expected the name of the struct field of the expression before
|
|
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION TRUE INCREASING
|
|
##
|
|
## Ends in an error in state: 159.
|
|
##
|
|
## mult_expression -> mult_expression . mult_op unop_expression [ XOR THEN SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR NOT_EQUAL MULTMONEY MULTDEC MULT MULDURATION MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER EXCEPTION EQUAL END_CODE ELSE DIVMONEY DIVDURATION DIVDEC DIV DEFINITION DECLARATION CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
## sum_expression -> mult_expression . [ XOR THEN SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR NOT_EQUAL MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER EXCEPTION EQUAL END_CODE ELSE DEFINITION DECLARATION CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## mult_expression
|
|
##
|
|
## 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 46, spurious reduction of production primitive_expression -> small_expression
|
|
## In state 85, spurious reduction of production base_expression -> primitive_expression
|
|
## In state 111, spurious reduction of production unop_expression -> base_expression
|
|
## In state 82, spurious reduction of production mult_expression -> unop_expression
|
|
##
|
|
|
|
expected an operator to compose the expression on the left
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION TRUE MULTMONEY YEAR
|
|
##
|
|
## Ends in an error in state: 156.
|
|
##
|
|
## mult_expression -> mult_expression mult_op . unop_expression [ XOR THEN SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR NOT_EQUAL MULTMONEY MULTDEC MULT MULDURATION MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER EXCEPTION EQUAL END_CODE ELSE DIVMONEY DIVDURATION DIVDEC DIV DEFINITION DECLARATION CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## mult_expression mult_op
|
|
##
|
|
|
|
expected an expression on the right side of the multiplication or division operator
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION TRUE NOT_EQUAL YEAR
|
|
##
|
|
## Ends in an error in state: 158.
|
|
##
|
|
## compare_expression -> sum_expression compare_op . compare_expression [ XOR THEN SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET OR LABEL EXCEPTION END_CODE ELSE DEFINITION DECLARATION CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## sum_expression compare_op
|
|
##
|
|
|
|
expected an expression on the right side of the comparison operator
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION TRUE OF YEAR
|
|
##
|
|
## Ends in an error in state: 98.
|
|
##
|
|
## base_expression -> primitive_expression OF . base_expression [ XOR THEN SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR NOT_EQUAL MULTMONEY MULTDEC MULT MULDURATION MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL INCREASING GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER EXCEPTION EQUAL END_CODE ELSE DIVMONEY DIVDURATION DIVDEC DIV DEFINITION DECREASING DECLARATION CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## primitive_expression OF
|
|
##
|
|
|
|
expected an expression for the argument of this function call
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION TRUE PLUSMONEY YEAR
|
|
##
|
|
## Ends in an error in state: 146.
|
|
##
|
|
## sum_expression -> sum_expression sum_op . mult_expression [ XOR THEN SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR NOT_EQUAL MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER EXCEPTION EQUAL END_CODE ELSE DEFINITION DECLARATION CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## sum_expression sum_op
|
|
##
|
|
|
|
expected an expression after the plus or minus operator
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION TRUE WE_HAVE
|
|
##
|
|
## Ends in an error in state: 85.
|
|
##
|
|
## base_expression -> primitive_expression . [ XOR THEN SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR NOT_EQUAL MULTMONEY MULTDEC MULT MULDURATION MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL INCREASING GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER EXCEPTION EQUAL END_CODE ELSE DIVMONEY DIVDURATION DIVDEC DIV DEFINITION DECREASING DECLARATION CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
## base_expression -> primitive_expression . OF base_expression [ XOR THEN SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR NOT_EQUAL MULTMONEY MULTDEC MULT MULDURATION MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL INCREASING GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER EXCEPTION EQUAL END_CODE ELSE DIVMONEY DIVDURATION DIVDEC DIV DEFINITION DECREASING DECLARATION CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
## base_expression -> primitive_expression . WITH constructor_binding [ XOR THEN SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR NOT_EQUAL MULTMONEY MULTDEC MULT MULDURATION MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL INCREASING GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER EXCEPTION EQUAL END_CODE ELSE DIVMONEY DIVDURATION DIVDEC DIV DEFINITION DECREASING DECLARATION CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
## base_expression -> primitive_expression . CONTAINS base_expression [ XOR THEN SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR NOT_EQUAL MULTMONEY MULTDEC MULT MULDURATION MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL INCREASING GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER EXCEPTION EQUAL END_CODE ELSE DIVMONEY DIVDURATION DIVDEC DIV DEFINITION DECREASING DECLARATION CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## primitive_expression
|
|
##
|
|
## 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 46, spurious reduction of production primitive_expression -> small_expression
|
|
##
|
|
|
|
the expression before ended, what follows next should be an operator or the rest of the code structure
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION TRUE WITH CONSTRUCTOR CONSTRUCTOR
|
|
##
|
|
## Ends in an error in state: 87.
|
|
##
|
|
## constructor_binding -> maybe_qualified_constructor . optional_binding [ XOR THEN SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR NOT_EQUAL MULTMONEY MULTDEC MULT MULDURATION MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL INCREASING GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER EXCEPTION EQUAL END_CODE ELSE DIVMONEY DIVDURATION DIVDEC DIV DEFINITION DECREASING DECLARATION CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## maybe_qualified_constructor
|
|
##
|
|
## 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 91, spurious reduction of production option(preceded(DOT,constructor)) ->
|
|
## In state 94, spurious reduction of production maybe_qualified_constructor -> constructor option(preceded(DOT,constructor))
|
|
##
|
|
|
|
a enum constructor pattern should be followed by a payload
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION TRUE WITH CONSTRUCTOR OF CONSTRUCTOR XOR
|
|
##
|
|
## Ends in an error in state: 89.
|
|
##
|
|
## optional_binding -> OF maybe_qualified_constructor . constructor_binding [ XOR THEN SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR NOT_EQUAL MULTMONEY MULTDEC MULT MULDURATION MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL INCREASING GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER EXCEPTION EQUAL END_CODE ELSE DIVMONEY DIVDURATION DIVDEC DIV DEFINITION DECREASING DECLARATION CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## OF maybe_qualified_constructor
|
|
##
|
|
## 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 91, spurious reduction of production option(preceded(DOT,constructor)) ->
|
|
## In state 94, spurious reduction of production maybe_qualified_constructor -> constructor option(preceded(DOT,constructor))
|
|
##
|
|
|
|
unexpected expression following a function application with an enum constructor name
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION TRUE WITH CONSTRUCTOR OF YEAR
|
|
##
|
|
## Ends in an error in state: 88.
|
|
##
|
|
## optional_binding -> OF . ident [ XOR THEN SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR NOT_EQUAL MULTMONEY MULTDEC MULT MULDURATION MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL INCREASING GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER EXCEPTION EQUAL END_CODE ELSE DIVMONEY DIVDURATION DIVDEC DIV DEFINITION DECREASING DECLARATION CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
## optional_binding -> OF . maybe_qualified_constructor constructor_binding [ XOR THEN SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR NOT_EQUAL MULTMONEY MULTDEC MULT MULDURATION MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL INCREASING GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER EXCEPTION EQUAL END_CODE ELSE DIVMONEY DIVDURATION DIVDEC DIV DEFINITION DECREASING DECLARATION CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## OF
|
|
##
|
|
|
|
expecting an expression to stand in as the function argument
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION TRUE WITH CONSTRUCTOR YEAR
|
|
##
|
|
## Ends in an error in state: 91.
|
|
##
|
|
## maybe_qualified_constructor -> constructor . option(preceded(DOT,constructor)) [ XOR THEN SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR OF NOT_EQUAL MULTMONEY MULTDEC MULT MULDURATION MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL INCREASING GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER EXCEPTION EQUAL END_CODE ELSE DIVMONEY DIVDURATION DIVDEC DIV DEFINITION DECREASING DECLARATION CONSTRUCTOR CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## constructor
|
|
##
|
|
|
|
the expression before ended, what follows next should be an operator or the rest of the code structure
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION TRUE WITH YEAR
|
|
##
|
|
## Ends in an error in state: 86.
|
|
##
|
|
## base_expression -> primitive_expression WITH . constructor_binding [ XOR THEN SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR NOT_EQUAL MULTMONEY MULTDEC MULT MULDURATION MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL INCREASING GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER EXCEPTION EQUAL END_CODE ELSE DIVMONEY DIVDURATION DIVDEC DIV DEFINITION DECREASING DECLARATION CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## primitive_expression WITH
|
|
##
|
|
|
|
<YOUR SYNTAX ERROR MESSAGE HERE>
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION TRUE XOR YEAR
|
|
##
|
|
## Ends in an error in state: 168.
|
|
##
|
|
## logical_or_expression -> logical_atom logical_or_op . logical_or_expression [ THEN SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET LABEL EXCEPTION END_CODE ELSE DEFINITION DECLARATION CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## logical_atom logical_or_op
|
|
##
|
|
|
|
<YOUR SYNTAX ERROR MESSAGE HERE>
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION TRUE YEAR
|
|
##
|
|
## Ends in an error in state: 46.
|
|
##
|
|
## primitive_expression -> small_expression . [ XOR WITH WE_HAVE THEN SUCH SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR OF NOT_EQUAL MULTMONEY MULTDEC MULT MULDURATION MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL INCREASING GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER FOR EXCEPTION EQUAL END_CODE ELSE DIVMONEY DIVDURATION DIVDEC DIV DEFINITION DECREASING DECLARATION CONTAINS CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
## small_expression -> small_expression . DOT option(terminated(constructor,DOT)) ident [ XOR WITH WE_HAVE THEN SUCH SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR OF NOT_EQUAL MULTMONEY MULTDEC MULT MULDURATION MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL INCREASING GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER FOR EXCEPTION EQUAL END_CODE ELSE DOT DIVMONEY DIVDURATION DIVDEC DIV DEFINITION DECREASING DECLARATION CONTAINS CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## small_expression
|
|
##
|
|
|
|
expected an enum constructor to test if the expression on the left
|
|
|
|
|
|
|
|
|
|
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION VERTICAL YEAR
|
|
##
|
|
## Ends in an error in state: 11.
|
|
##
|
|
## literal -> VERTICAL . DATE_LITERAL VERTICAL [ XOR WITH WE_HAVE THEN SUCH SEMICOLON SCOPE RULE RSQUARE RPAREN RBRACKET PLUSPLUS PLUSMONEY PLUSDURATION PLUSDEC PLUSDATE PLUS OR OF NOT_EQUAL MULTMONEY MULTDEC MULT MULDURATION MINUSMONEY MINUSDURATION MINUSDEC MINUSDATE MINUS LESSER_MONEY LESSER_EQUAL_MONEY LESSER_EQUAL_DURATION LESSER_EQUAL_DEC LESSER_EQUAL_DATE LESSER_EQUAL LESSER_DURATION LESSER_DEC LESSER_DATE LESSER LABEL INCREASING GREATER_MONEY GREATER_EQUAL_MONEY GREATER_EQUAL_DURATION GREATER_EQUAL_DEC GREATER_EQUAL_DATE GREATER_EQUAL GREATER_DURATION GREATER_DEC GREATER_DATE GREATER FOR EXCEPTION EQUAL END_CODE ELSE DOT DIVMONEY DIVDURATION DIVDEC DIV DEFINITION DECREASING DECLARATION CONTAINS CONSEQUENCE COLON ASSERTION AND ALT ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## VERTICAL
|
|
##
|
|
|
|
expected the year for this date literal
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR UNDER_CONDITION YEAR
|
|
##
|
|
## Ends in an error in state: 10.
|
|
##
|
|
## scope_use_condition -> UNDER_CONDITION . expression [ COLON ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## UNDER_CONDITION
|
|
##
|
|
|
|
expected an expression
|
|
|
|
source_file: BEGIN_CODE SCOPE CONSTRUCTOR YEAR
|
|
##
|
|
## Ends in an error in state: 9.
|
|
##
|
|
## code_item -> SCOPE constructor . option(scope_use_condition) COLON nonempty_list(scope_item) [ SCOPE END_CODE DECLARATION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## SCOPE constructor
|
|
##
|
|
|
|
expected a scope use condition or the content of this scope use
|
|
|
|
source_file: BEGIN_CODE SCOPE YEAR
|
|
##
|
|
## Ends in an error in state: 7.
|
|
##
|
|
## code_item -> SCOPE . constructor option(scope_use_condition) COLON nonempty_list(scope_item) [ SCOPE END_CODE DECLARATION ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## SCOPE
|
|
##
|
|
|
|
expected the name of the scope being used
|
|
|
|
source_file: BEGIN_CODE YEAR
|
|
##
|
|
## Ends in an error in state: 371.
|
|
##
|
|
## source_file_item -> BEGIN_CODE . code END_CODE [ LAW_TEXT LAW_HEADING EOF BEGIN_METADATA BEGIN_DIRECTIVE BEGIN_CODE ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## BEGIN_CODE
|
|
##
|
|
|
|
expected some declaration or scope use inside this code block
|
|
|
|
|
|
|
|
|
|
|
|
|
|
source_file: LAW_TEXT YEAR
|
|
##
|
|
## Ends in an error in state: 1.
|
|
##
|
|
## nonempty_list(LAW_TEXT) -> LAW_TEXT . [ SCOPE LAW_TEXT LAW_HEADING EOF END_CODE DECLARATION BEGIN_METADATA BEGIN_DIRECTIVE BEGIN_CODE ]
|
|
## nonempty_list(LAW_TEXT) -> LAW_TEXT . nonempty_list(LAW_TEXT) [ SCOPE LAW_TEXT LAW_HEADING EOF END_CODE DECLARATION BEGIN_METADATA BEGIN_DIRECTIVE BEGIN_CODE ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
## LAW_TEXT
|
|
##
|
|
|
|
expected some law text or code block
|
|
|
|
source_file: YEAR
|
|
##
|
|
## Ends in an error in state: 0.
|
|
##
|
|
## source_file' -> . source_file [ # ]
|
|
##
|
|
## The known suffix of the stack is as follows:
|
|
##
|
|
##
|
|
|
|
expected some law text or code block
|