68 lines
1.6 KiB
Python
68 lines
1.6 KiB
Python
from smnp.ast.node.operator import BinaryOperator
|
|
from smnp.ast.node.term import TermParser
|
|
from smnp.ast.parser import Parser
|
|
from smnp.token.type import TokenType
|
|
|
|
|
|
class Sum(BinaryOperator):
|
|
pass
|
|
|
|
|
|
class Relation(BinaryOperator):
|
|
pass
|
|
|
|
|
|
class And(BinaryOperator):
|
|
pass
|
|
|
|
|
|
class Or(BinaryOperator):
|
|
pass
|
|
|
|
|
|
def ExpressionParser(input):
|
|
from smnp.ast.node.condition import IfElse
|
|
|
|
expr1 = Parser.leftAssociativeOperatorParser(
|
|
TermParser,
|
|
[TokenType.PLUS, TokenType.MINUS],
|
|
TermParser,
|
|
lambda left, op, right: Sum.withValues(left, op, right)
|
|
)
|
|
|
|
expr2 = Parser.leftAssociativeOperatorParser(
|
|
expr1,
|
|
[TokenType.RELATION, TokenType.OPEN_ANGLE, TokenType.CLOSE_ANGLE],
|
|
expr1,
|
|
lambda left, op, right: Relation.withValues(left, op, right)
|
|
)
|
|
|
|
expr3 = Parser.leftAssociativeOperatorParser(
|
|
expr2,
|
|
[TokenType.AND],
|
|
expr2,
|
|
lambda left, op, right: And.withValues(left, op, right)
|
|
)
|
|
|
|
expr4 = Parser.leftAssociativeOperatorParser(
|
|
expr3,
|
|
[TokenType.OR],
|
|
expr3,
|
|
lambda left, op, right: Or.withValues(left, op, right)
|
|
)
|
|
|
|
ifElseExpression = Parser.allOf(
|
|
expr4,
|
|
Parser.terminal(TokenType.IF),
|
|
Parser.doAssert(expr4, "expression"),
|
|
Parser.terminal(TokenType.ELSE, doAssert=True),
|
|
Parser.doAssert(expr4, "expression"),
|
|
createNode=lambda ifNode, _, condition, __, elseNode: IfElse.createNode(ifNode, condition, elseNode)
|
|
)
|
|
|
|
return Parser.oneOf(
|
|
ifElseExpression,
|
|
expr4,
|
|
)(input)
|
|
|