Create oneOf and allOf parsers
This commit is contained in:
Bartłomiej Pluta
@@ -1,6 +1,5 @@
|
||||
from smnp.ast.node.ignore import IgnoredNode
|
||||
from smnp.ast.node.model import ParseResult, Node
|
||||
from smnp.ast.node.none import NoneNode
|
||||
from smnp.error.syntax import SyntaxException
|
||||
|
||||
|
||||
@@ -9,15 +8,8 @@ def parse(input):
|
||||
return ProgramParser(input).node
|
||||
|
||||
|
||||
class Parser:
|
||||
def __init__(self, parse, name=None, parsers=None):
|
||||
if parsers is None:
|
||||
parsers = []
|
||||
self.parsers = parsers
|
||||
|
||||
self._parse = parse
|
||||
if name is None:
|
||||
name = parse.__name__
|
||||
class Parser(object):
|
||||
def __init__(self, name):
|
||||
self.name = name
|
||||
|
||||
def parse(self, input):
|
||||
@@ -26,10 +18,22 @@ class Parser:
|
||||
return ParseResult.FAIL()
|
||||
|
||||
if not isinstance(result, ParseResult):
|
||||
raise RuntimeError(f"_parse() method of '{self.__class__.__name__}' class haven't returned ParseResult object")
|
||||
raise RuntimeError(
|
||||
f"_parse() method of '{self.__class__.__name__}' class haven't returned ParseResult object")
|
||||
|
||||
return result
|
||||
|
||||
def _parse(self, input):
|
||||
raise RuntimeError(f"_name method of '{self.__class__.__name__}' class is not implemented")
|
||||
|
||||
def grammar(self):
|
||||
rules = []
|
||||
self._grammarRules(rules)
|
||||
return "\n".join(rules)
|
||||
|
||||
def _grammarRules(self, output):
|
||||
output.append(f"class '{self.__class__.__name__}' does not implement _grammarRules() method")
|
||||
|
||||
def __call__(self, input):
|
||||
return self.parse(input)
|
||||
|
||||
@@ -39,171 +43,266 @@ class Parser:
|
||||
def __repr__(self):
|
||||
return self.__str__()
|
||||
|
||||
# a -> A
|
||||
@staticmethod
|
||||
def terminalParser(expectedType, createNode=None, doAssert=False):
|
||||
def provideNode(value, pos):
|
||||
if createNode is None:
|
||||
return IgnoredNode(pos)
|
||||
return createNode(value, pos)
|
||||
|
||||
def parse(input):
|
||||
if input.hasCurrent() and input.current().type == expectedType:
|
||||
token = input.current()
|
||||
input.ahead()
|
||||
return ParseResult.OK(provideNode(token.value, token.pos))
|
||||
elif doAssert:
|
||||
found = f", found '{input.current().rawValue}'" if input.hasCurrent() else ""
|
||||
raise SyntaxException(f"Expected '{expectedType.key}'{found}", input.currentPos())
|
||||
class TerminalParser(Parser):
|
||||
|
||||
return ParseResult.FAIL()
|
||||
def __init__(self, expectedType, createNode=lambda val, pos: IgnoredNode(pos), doAssert=False):
|
||||
super().__init__(expectedType.name.lower())
|
||||
self.expectedType = expectedType
|
||||
self.createNode = createNode
|
||||
self.doAssert = doAssert
|
||||
|
||||
return Parser(parse, name=expectedType.name.lower())
|
||||
def _grammarRules(self, output):
|
||||
output.append(f"{self.name} -> '{self.expectedType.value}'")
|
||||
|
||||
# oneOf -> a | b | c | ...
|
||||
@staticmethod
|
||||
def oneOf(*parsers, exception=None, name="or"):
|
||||
def combinedParser(input):
|
||||
snap = input.snapshot()
|
||||
for parser in parsers:
|
||||
value = parser(input)
|
||||
if value.result:
|
||||
return value
|
||||
def _parse(self, input):
|
||||
if input.isCurrent(self.expectedType):
|
||||
token = input.current()
|
||||
input.ahead()
|
||||
return ParseResult.OK(self.createNode(token.value, token.pos))
|
||||
elif self.doAssert:
|
||||
found = f", found '{input.current().rawValue}'" if input.hasCurrent() else ""
|
||||
raise SyntaxException(f"Expected '{self.expectedType.key}'{found}", input.currentPos())
|
||||
|
||||
if exception is not None:
|
||||
if callable(exception):
|
||||
raise exception(input)
|
||||
else:
|
||||
raise exception
|
||||
return ParseResult.FAIL()
|
||||
|
||||
|
||||
input.reset(snap)
|
||||
return ParseResult.FAIL()
|
||||
class OneOfParser(Parser):
|
||||
def __init__(self, *parsers, name, exception=None):
|
||||
super().__init__(name)
|
||||
self.parsers = parsers
|
||||
self.exception = exception
|
||||
|
||||
return Parser(combinedParser, name=name, parsers=parsers)
|
||||
def _parse(self, input):
|
||||
snap = input.snapshot()
|
||||
for parser in self.parsers:
|
||||
value = parser.parse(input)
|
||||
if value.result:
|
||||
return value
|
||||
input.reset(snap) # TODO sprawdzic, czy koneiczne !!!!!
|
||||
|
||||
if self.exception is not None:
|
||||
if callable(self.exception):
|
||||
raise self.exception(input)
|
||||
else:
|
||||
raise self.exception
|
||||
|
||||
return ParseResult.FAIL()
|
||||
|
||||
def _grammarRules(self, output):
|
||||
output.extend([ f"{self.name} -> {parser.name}" for parser in self.parsers ])
|
||||
[ parser._grammarRules(output) for parser in self.parsers ]
|
||||
|
||||
|
||||
class AllOfParser(Parser):
|
||||
def __init__(self, *parsers, createNode, exception=None, name):
|
||||
super().__init__(name)
|
||||
|
||||
# allOf -> a b c ...
|
||||
@staticmethod
|
||||
def allOf(*parsers, createNode, exception=None, name="all"):
|
||||
if len(parsers) == 0:
|
||||
raise RuntimeError("Pass one parser at least")
|
||||
|
||||
def extendedParser(input):
|
||||
snap = input.snapshot()
|
||||
self.parsers = parsers
|
||||
self.createNode = createNode
|
||||
self.exception = exception
|
||||
|
||||
results = []
|
||||
def _parse(self, input):
|
||||
snap = input.snapshot()
|
||||
parsedItems = []
|
||||
|
||||
for parser in parsers:
|
||||
result = parser(input)
|
||||
|
||||
if not result.result:
|
||||
if exception is not None:
|
||||
if callable(exception):
|
||||
raise exception(input)
|
||||
else:
|
||||
raise exception
|
||||
|
||||
input.reset(snap)
|
||||
return ParseResult.FAIL()
|
||||
|
||||
results.append(result.node)
|
||||
|
||||
node = createNode(*results)
|
||||
if not isinstance(node, Node):
|
||||
raise RuntimeError("Function 'createNode' haven't returned a Node object. Probably forget to pass 'return'")
|
||||
|
||||
return ParseResult.OK(node)
|
||||
|
||||
|
||||
return Parser(extendedParser, name=name, parsers=parsers)
|
||||
|
||||
|
||||
# leftAssociative -> left | left OP right
|
||||
@staticmethod
|
||||
def leftAssociativeOperatorParser(leftParser, operatorTokenTypes, rightParser, createNode, name="leftAssoc"):
|
||||
from smnp.ast.node.operator import Operator
|
||||
|
||||
def parse(input):
|
||||
operatorParser = Parser.oneOfTerminals(*operatorTokenTypes, createNode=lambda val, pos: Operator.withChildren([val], pos))
|
||||
left = leftParser(input)
|
||||
if left.result:
|
||||
operator = operatorParser(input)
|
||||
while operator.result:
|
||||
right = rightParser(input)
|
||||
left = ParseResult.OK(createNode(left.node, operator.node, right.node))
|
||||
operator = operatorParser(input)
|
||||
return left
|
||||
|
||||
return ParseResult.FAIL()
|
||||
|
||||
return Parser(parse, name=name, parsers=[leftParser, '|'.join([t.value for t in operatorTokenTypes]), rightParser])
|
||||
|
||||
@staticmethod
|
||||
def oneOfTerminals(*tokenTypes, createNode=None):
|
||||
return Parser.oneOf(*[ Parser.terminalParser(expectedType, createNode=createNode) for expectedType in tokenTypes ], name='|'.join([t.value for t in tokenTypes]))
|
||||
|
||||
# loop -> start item* end
|
||||
@staticmethod
|
||||
def loop(startParser, itemParser, endParser, createNode, name="loop"):
|
||||
def parse(input):
|
||||
items = []
|
||||
start = startParser(input)
|
||||
if start.result:
|
||||
while True:
|
||||
end = endParser(input)
|
||||
if end.result:
|
||||
return ParseResult.OK(createNode(start.node, items, end.node))
|
||||
item = itemParser(input)
|
||||
if not item.result:
|
||||
return ParseResult.FAIL()
|
||||
items.append(item.node)
|
||||
|
||||
return ParseResult.FAIL()
|
||||
|
||||
return Parser(parse, name, parsers=[startParser, itemParser, endParser])
|
||||
|
||||
@staticmethod
|
||||
def doAssert(parser, expected, name="!!"):
|
||||
def parse(input):
|
||||
result = parser(input)
|
||||
for parser in self.parsers:
|
||||
result = parser.parse(input)
|
||||
|
||||
if not result.result:
|
||||
found = f", found '{input.current().rawValue}'" if input.hasCurrent() else ''
|
||||
if self.exception is not None:
|
||||
if callable(self.exception):
|
||||
raise self.exception(input)
|
||||
else:
|
||||
raise self.exception
|
||||
|
||||
raise SyntaxException(f"Expected {expected}{found}", input.currentPos())
|
||||
input.reset(snap)
|
||||
return ParseResult.FAIL()
|
||||
|
||||
return result
|
||||
parsedItems.append(result.node)
|
||||
|
||||
return Parser(parse, name, parsers=parser)
|
||||
node = self.createNode(*parsedItems)
|
||||
if not isinstance(node, Node):
|
||||
raise RuntimeError(f"Method 'createNode' of class '{self.__class__.__name__}' haven't returned a Node object. Probably forget to pass 'return'")
|
||||
|
||||
@staticmethod
|
||||
def optional(parser, name="??"):
|
||||
def parse(input):
|
||||
result = parser(input)
|
||||
if result.result:
|
||||
return result
|
||||
return ParseResult.OK(node)
|
||||
|
||||
return ParseResult.OK(NoneNode())
|
||||
def _grammarRules(self, output):
|
||||
output.append(self.name + ' -> ' + ' '.join([ parser.name for parser in self.parsers ]))
|
||||
[ parser._grammarRules(output) for parser in self.parsers ]
|
||||
|
||||
return Parser(parse, name, parsers=[parser])
|
||||
# def allOf(*parsers, createNode, exception=None, name="all"):
|
||||
# if len(parsers) == 0:
|
||||
# raise RuntimeError("Pass one parser at least")
|
||||
#
|
||||
# def extendedParser(input):
|
||||
# snap = input.snapshot()
|
||||
#
|
||||
# results = []
|
||||
#
|
||||
# for parser in parsers:
|
||||
# result = parser(input)
|
||||
#
|
||||
# if not result.result:
|
||||
# if exception is not None:
|
||||
# if callable(exception):
|
||||
# raise exception(input)
|
||||
# else:
|
||||
# raise exception
|
||||
#
|
||||
# input.reset(snap)
|
||||
# return ParseResult.FAIL()
|
||||
#
|
||||
# results.append(result.node)
|
||||
#
|
||||
# node = createNode(*results)
|
||||
# if not isinstance(node, Node):
|
||||
# raise RuntimeError("Function 'createNode' haven't returned a Node object. Probably forget to pass 'return'")
|
||||
#
|
||||
# return ParseResult.OK(node)
|
||||
#
|
||||
#
|
||||
# return Parser(extendedParser, name=name, parsers=parsers)
|
||||
#
|
||||
|
||||
@staticmethod
|
||||
def epsilon():
|
||||
return lambda *args: ParseResult.OK(NoneNode())
|
||||
|
||||
@staticmethod
|
||||
def many(parser, createNode, name="*"):
|
||||
def parse(input):
|
||||
results = []
|
||||
snap = input.snapshot()
|
||||
pos = input.currentPos()
|
||||
while True:
|
||||
result = parser(input)
|
||||
if result.result:
|
||||
results.append(result.node)
|
||||
snap = input.snapshot()
|
||||
else:
|
||||
input.reset(snap)
|
||||
return ParseResult.OK(createNode(results, pos) if len(results) > 0 else NoneNode())
|
||||
# def o
|
||||
# # a -> A
|
||||
# @staticmethod
|
||||
# def terminalParser(expectedType, createNode=None, doAssert=False):
|
||||
# def provideNode(value, pos):
|
||||
# if createNode is None:
|
||||
# return IgnoredNode(pos)
|
||||
# return createNode(value, pos)
|
||||
#
|
||||
# def parse(input):
|
||||
# if input.hasCurrent() and input.current().type == expectedType:
|
||||
# token = input.current()
|
||||
# input.ahead()
|
||||
# return ParseResult.OK(provideNode(token.value, token.pos))
|
||||
# elif doAssert:
|
||||
# found = f", found '{input.current().rawValue}'" if input.hasCurrent() else ""
|
||||
# raise SyntaxException(f"Expected '{expectedType.key}'{found}", input.currentPos())
|
||||
#
|
||||
# return ParseResult.FAIL()
|
||||
#
|
||||
# return Parser(parse, name=expectedType.name.lower())
|
||||
#
|
||||
# # oneOf -> a | b | c | ...
|
||||
# @staticmethod
|
||||
# def oneOf(*parsers, exception=None, name="or"):
|
||||
# def combinedParser(input):
|
||||
# snap = input.snapshot()
|
||||
# for parser in parsers:
|
||||
# value = parser(input)
|
||||
# if value.result:
|
||||
# return value
|
||||
#
|
||||
# if exception is not None:
|
||||
# if callable(exception):
|
||||
# raise exception(input)
|
||||
# else:
|
||||
# raise exception
|
||||
#
|
||||
#
|
||||
# input.reset(snap)
|
||||
# return ParseResult.FAIL()
|
||||
#
|
||||
# return Parser(combinedParser, name=name, parsers=parsers)
|
||||
#
|
||||
# # allOf -> a b c ...
|
||||
# @staticmethod
|
||||
|
||||
return Parser(parse, name, parsers=[parser])
|
||||
#
|
||||
# # leftAssociative -> left | left OP right
|
||||
# @staticmethod
|
||||
# def leftAssociativeOperatorParser(leftParser, operatorTokenTypes, rightParser, createNode, name="leftAssoc"):
|
||||
# from smnp.ast.node.operator import Operator
|
||||
#
|
||||
# def parse(input):
|
||||
# operatorParser = Parser.oneOfTerminals(*operatorTokenTypes, createNode=lambda val, pos: Operator.withChildren([val], pos))
|
||||
# left = leftParser(input)
|
||||
# if left.result:
|
||||
# operator = operatorParser(input)
|
||||
# while operator.result:
|
||||
# right = rightParser(input)
|
||||
# left = ParseResult.OK(createNode(left.node, operator.node, right.node))
|
||||
# operator = operatorParser(input)
|
||||
# return left
|
||||
#
|
||||
# return ParseResult.FAIL()
|
||||
#
|
||||
# return Parser(parse, name=name, parsers=[leftParser, '|'.join([t.value for t in operatorTokenTypes]), rightParser])
|
||||
#
|
||||
# @staticmethod
|
||||
# def oneOfTerminals(*tokenTypes, createNode=None):
|
||||
# return Parser.oneOf(*[ Parser.terminalParser(expectedType, createNode=createNode) for expectedType in tokenTypes ], name='|'.join([t.value for t in tokenTypes]))
|
||||
#
|
||||
# # loop -> start item* end
|
||||
# @staticmethod
|
||||
# def loop(startParser, itemParser, endParser, createNode, name="loop"):
|
||||
# def parse(input):
|
||||
# items = []
|
||||
# start = startParser(input)
|
||||
# if start.result:
|
||||
# while True:
|
||||
# end = endParser(input)
|
||||
# if end.result:
|
||||
# return ParseResult.OK(createNode(start.node, items, end.node))
|
||||
# item = itemParser(input)
|
||||
# if not item.result:
|
||||
# return ParseResult.FAIL()
|
||||
# items.append(item.node)
|
||||
#
|
||||
# return ParseResult.FAIL()
|
||||
#
|
||||
# return Parser(parse, name, parsers=[startParser, itemParser, endParser])
|
||||
#
|
||||
# @staticmethod
|
||||
# def doAssert(parser, expected, name="!!"):
|
||||
# def parse(input):
|
||||
# result = parser(input)
|
||||
#
|
||||
# if not result.result:
|
||||
# found = f", found '{input.current().rawValue}'" if input.hasCurrent() else ''
|
||||
#
|
||||
# raise SyntaxException(f"Expected {expected}{found}", input.currentPos())
|
||||
#
|
||||
# return result
|
||||
#
|
||||
# return Parser(parse, name, parsers=parser)
|
||||
#
|
||||
# @staticmethod
|
||||
# def optional(parser, name="??"):
|
||||
# def parse(input):
|
||||
# result = parser(input)
|
||||
# if result.result:
|
||||
# return result
|
||||
#
|
||||
# return ParseResult.OK(NoneNode())
|
||||
#
|
||||
# return Parser(parse, name, parsers=[parser])
|
||||
#
|
||||
# @staticmethod
|
||||
# def epsilon():
|
||||
# return lambda *args: ParseResult.OK(NoneNode())
|
||||
#
|
||||
# @staticmethod
|
||||
# def many(parser, createNode, name="*"):
|
||||
# def parse(input):
|
||||
# results = []
|
||||
# snap = input.snapshot()
|
||||
# pos = input.currentPos()
|
||||
# while True:
|
||||
# result = parser(input)
|
||||
# if result.result:
|
||||
# results.append(result.node)
|
||||
# snap = input.snapshot()
|
||||
# else:
|
||||
# input.reset(snap)
|
||||
# return ParseResult.OK(createNode(results, pos) if len(results) > 0 else NoneNode())
|
||||
#
|
||||
# return Parser(parse, name, parsers=[parser])
|
||||
|
||||
35
smnp/main.py
35
smnp/main.py
@@ -1,15 +1,42 @@
|
||||
import sys
|
||||
|
||||
from smnp.ast.node.model import Node
|
||||
from smnp.ast.parser import TerminalParser, OneOfParser, AllOfParser
|
||||
from smnp.error.base import SmnpException
|
||||
from smnp.program.interpreter import Interpreter
|
||||
from smnp.token.tokenizer import tokenize
|
||||
from smnp.token.type import TokenType
|
||||
|
||||
|
||||
def main():
|
||||
try:
|
||||
#stdLibraryEnv = loadStandardLibrary()
|
||||
Interpreter.interpretFile(sys.argv[1], printTokens=True, printAst=True, execute=False, baseEnvironment=None)
|
||||
#Interpreter.interpretFile(sys.argv[1], printTokens=True, printAst=True, execute=False, baseEnvironment=None)
|
||||
#draft()
|
||||
|
||||
def node(*items):
|
||||
n = Node((-1, -1))
|
||||
n.children = items
|
||||
return n
|
||||
|
||||
tokens = tokenize(['=x'])
|
||||
parser = AllOfParser(
|
||||
OneOfParser(
|
||||
TerminalParser(TokenType.ASSIGN),
|
||||
TerminalParser(TokenType.ASTERISK),
|
||||
name="assignOrAsterisk"
|
||||
),
|
||||
TerminalParser(TokenType.INTEGER),
|
||||
name="aoaInt",
|
||||
createNode=node
|
||||
)
|
||||
print(parser.grammar())
|
||||
res = parser.parse(tokens)
|
||||
|
||||
|
||||
print()
|
||||
if res.result:
|
||||
res.node.print()
|
||||
else:
|
||||
print("nie sparsowano")
|
||||
|
||||
except SmnpException as e:
|
||||
print(e.message())
|
||||
|
||||
|
||||
Reference in New Issue
Block a user