class Stacklang::Parser
- Stacklang::Parser
- Reference
- Object
Defined in:
stacklang/parser.crConstant Summary
-
NEWLINE =
"\n" -
OPERATORS_PRIORITIES =
[{Arity::Binary, Associativity::Left, ["."]}, {Arity::Binary, Associativity::Left, ["["]}, {Arity::Unary, nil, ["!", "~", "&", "*", "-"]}, {Arity::Binary, Associativity::Left, ["/", "*"]}, {Arity::Binary, Associativity::Left, ["+", "-"]}, {Arity::Binary, Associativity::Left, [">>", "<<"]}, {Arity::Binary, Associativity::Left, ["&"]}, {Arity::Binary, Associativity::Left, ["|", "^"]}, {Arity::Binary, Associativity::Left, ["==", "!="]}, {Arity::Binary, Associativity::Left, ["<", ">", "<=", ">="]}, {Arity::Binary, Associativity::Left, ["&&"]}, {Arity::Binary, Associativity::Left, ["||"]}, {Arity::Binary, Associativity::Right, ["=", "+=", "-="]}] -
List of operator groups ordered by decreasing precedence. Mostly following crystal lang
Constructors
Class Method Summary
Instance Method Summary
-
#consume!(expected) : Token
Consume a token and raise if it not equal to expected.
-
#consume?(token)
Return true and consume the current token value if it is equal to token parameter.
-
#current
Return the current token
-
#eof?
True if End Of File is reached.
- #expression
-
#expression_lexer : Array(AST::Expression | NamedTuple(kind: Arity, value: Tokenizer::Token))
Consume greedely all tokens of a single expression.
-
#expression_parser(chain : Array(AST::Expression | NamedTuple(kind: Arity, value: Tokenizer::Token))) : AST::Expression
Take a chain of
Expressionast nodes and unprocessed operators (as the output of#expression_lexer) and solve the operator precedence and associativity to produce one singleExpressionast node. -
#function
Parse and return a function.
- #global
-
#identifier(token = nil)
Parse and return an identifier.
- #literal(token = nil)
-
#next_token!(expected) : Token
Get the next token value.
- #number(token = nil)
- #requirement
- #statement
- #structure
-
#syntax_error(expected, context = nil) : Exception
Raise an error stating that the current token is unexpected.
-
#type_constraint(context_token : Token, colon = true, explicit = false)
Context token is used to document syntax error in case a type AST node is generated implicitely
-
#type_name(token = nil)
parse and return a type name.
-
#type_name?(token = nil)
Try to parse and return a type name.
- #unit
Constructor Detail
Class Method Detail
Instance Method Detail
Consume a token and raise if it not equal to expected. Return the token.
Return true and consume the current token value if it is equal to token parameter. return false otherwise.
Consume greedely all tokens of a single expression. Stop when it reach a ')', '}', ',', ']' It parse leaf expression as ast node, but keep operators as is in the order they appear. Return an array of all the component of the expression in their original order, mixing ast node and tuples in the form {kind: Symbol, value: Token} for operators.
Take a chain of Expression ast nodes and unprocessed operators (as the output of #expression_lexer)
and solve the operator precedence and associativity to produce one single Expression ast node.
Parse and return an identifier. If an identifier is given as a parameter, it use it instead of consuming a token.
Get the next token value. Raise if none. Parameter expected is used to document the raised error.
Raise an error stating that the current token is unexpected. The expected parameter is used to document the error.
Context token is used to document syntax error in case a type AST node is generated implicitely
parse and return a type name. If a type name is given as a parameter, it use it instead of consuming a token.
Try to parse and return a type name. If a type name is given as a parameter, it use it instead of consuming a token. If it fail, it return nil and does not alter the state.