1365 lines
44 KiB
Python
1365 lines
44 KiB
Python
import ast
|
|
from dataclasses import dataclass
|
|
from typing import Union
|
|
|
|
from core.builtin_concepts import ReturnValueConcept
|
|
from core.builtin_helpers import CreateObjectIdentifiers
|
|
from core.concept import Concept, ConceptParts, DoNotResolve, AllConceptParts
|
|
from core.rule import Rule
|
|
from core.tokenizer import Tokenizer, TokenKind, Token
|
|
from core.utils import get_text_from_tokens, tokens_index, str_concept
|
|
from parsers.BaseNodeParser import UnrecognizedTokensNode, SourceCodeNode, RuleNode, ConceptNode, \
|
|
SourceCodeWithConceptNode
|
|
from parsers.FunctionParser import FunctionNode
|
|
from parsers.PythonParser import PythonNode
|
|
from parsers.SyaNodeParser import SyaConceptParserHelper
|
|
from parsers.expressions import NameExprNode, AndNode, OrNode, NotNode, VariableNode, ComparisonNode, ComparisonType, \
|
|
FunctionParameter
|
|
from sheerkarete.common import V
|
|
from sheerkarete.conditions import Condition, AndConditions
|
|
|
|
|
|
@dataclass
|
|
class Obj:
|
|
prop_a: object
|
|
prop_b: object = None
|
|
prop_c: object = None
|
|
parent: object = None
|
|
|
|
|
|
class AND:
|
|
""" Test class for AndNode"""
|
|
|
|
def __init__(self, *parts, source=None):
|
|
self.parts = parts
|
|
self.source = source
|
|
|
|
|
|
class OR:
|
|
""" Test class for OrNode"""
|
|
|
|
def __init__(self, *parts, source=None):
|
|
self.parts = parts
|
|
self.source = source
|
|
|
|
|
|
@dataclass
|
|
class NOT:
|
|
""" Test class for NotNode"""
|
|
expr: object
|
|
source: str = None
|
|
|
|
|
|
@dataclass
|
|
class EXPR:
|
|
"""Test class for NameNode. E stands for Expression"""
|
|
source: str
|
|
|
|
|
|
@dataclass
|
|
class VAR:
|
|
"""Test class for VarNode"""
|
|
full_name: str
|
|
source: str = None
|
|
|
|
|
|
@dataclass
|
|
class EQ:
|
|
left: object
|
|
right: object
|
|
source: str = None
|
|
|
|
|
|
@dataclass
|
|
class NEQ:
|
|
left: object
|
|
right: object
|
|
source: str = None
|
|
|
|
|
|
@dataclass
|
|
class GT:
|
|
left: object
|
|
right: object
|
|
source: str = None
|
|
|
|
|
|
@dataclass
|
|
class GTE:
|
|
left: object
|
|
right: object
|
|
source: str = None
|
|
|
|
|
|
@dataclass
|
|
class LT:
|
|
left: object
|
|
right: object
|
|
source: str = None
|
|
|
|
|
|
@dataclass
|
|
class LTE:
|
|
left: object
|
|
right: object
|
|
source: str = None
|
|
|
|
|
|
@dataclass
|
|
class IN:
|
|
left: object
|
|
right: object
|
|
source: str = None
|
|
|
|
|
|
@dataclass
|
|
class NIN: # for NOT INT
|
|
left: object
|
|
right: object
|
|
source: str = None
|
|
|
|
|
|
@dataclass
|
|
class PAREN: # for parenthesis node
|
|
node: object
|
|
source: str = None
|
|
|
|
|
|
class CC:
|
|
"""
|
|
Concept class for test purpose
|
|
CC means concept for compiled (or concept with compiled)
|
|
It matches a concept if the compiles are equals
|
|
"""
|
|
|
|
# The only properties that are testes are concept_key and compiled
|
|
# The other properties (concept, source, start and end)
|
|
# are used in tests/parsers/parsers_utils.py to help creating helper objects
|
|
|
|
def __init__(self, concept, source=None, exclude_body=False, **kwargs):
|
|
self.concept_key = concept.key if isinstance(concept, Concept) else concept
|
|
self.compiled = kwargs
|
|
self.concept = concept if isinstance(concept, Concept) else None
|
|
self.source = source # to use when the key is different from the sub str to search when filling start and stop
|
|
self.start = None # for debug purpose, indicate where the concept starts
|
|
self.end = None # for debug purpose, indicate where the concept ends
|
|
self.exclude_body = exclude_body
|
|
|
|
if "body" in self.compiled:
|
|
self.compiled[ConceptParts.BODY] = self.compiled["body"]
|
|
del self.compiled["body"]
|
|
|
|
def __eq__(self, other):
|
|
if id(self) == id(other):
|
|
return True
|
|
|
|
if isinstance(other, Concept):
|
|
if other.key != self.concept_key:
|
|
return False
|
|
if self.exclude_body:
|
|
to_compare = {k: v for k, v in other.get_compiled().items() if k != ConceptParts.BODY}
|
|
else:
|
|
to_compare = other.get_compiled()
|
|
if self.compiled == to_compare:
|
|
return True
|
|
else:
|
|
return False
|
|
|
|
if not isinstance(other, CC):
|
|
return False
|
|
|
|
if self.concept_key != other.concept_key:
|
|
return False
|
|
|
|
return self.compiled == other.compiled
|
|
|
|
def __hash__(self):
|
|
if self.concept:
|
|
return hash(self.concept)
|
|
return hash(self.concept_key)
|
|
|
|
def __repr__(self):
|
|
if self.concept:
|
|
txt = f"CC(concept='{self.concept}'"
|
|
else:
|
|
txt = f"CC(concept_key='{self.concept_key}'"
|
|
|
|
for k, v in self.compiled.items():
|
|
txt += f", {k}='{v}'"
|
|
return txt + ")"
|
|
|
|
def fix_pos(self, node):
|
|
start = node.start if hasattr(node, "start") else \
|
|
node[0] if isinstance(node, tuple) else None
|
|
end = node.end if hasattr(node, "end") else \
|
|
node[1] if isinstance(node, tuple) else None
|
|
|
|
if start is not None:
|
|
if self.start is None or start < self.start:
|
|
self.start = start
|
|
|
|
if end is not None:
|
|
if self.end is None or end > self.end:
|
|
self.end = end
|
|
return self
|
|
|
|
def transform_real_obj(self, other, to_compare_delegate):
|
|
"""
|
|
Transform other into CNC, to ease the comparison
|
|
:param other:
|
|
:param to_compare_delegate:
|
|
:return:
|
|
"""
|
|
|
|
if isinstance(other, CC):
|
|
return other
|
|
|
|
if isinstance(other, Concept):
|
|
if self.exclude_body:
|
|
compiled = {k: v for k, v in other.get_compiled().items() if k != ConceptParts.BODY}
|
|
else:
|
|
compiled = other.get_compiled()
|
|
|
|
self_compile_to_use = self.compiled or compiled
|
|
|
|
compiled = to_compare_delegate(self_compile_to_use, compiled, to_compare_delegate)
|
|
return CC(other,
|
|
self.source,
|
|
self.exclude_body,
|
|
**compiled)
|
|
|
|
raise NotImplementedError(f"CC, {other=}")
|
|
|
|
|
|
class CB:
|
|
"""
|
|
Concept with body only
|
|
Test class that tests only the body of the concept
|
|
"""
|
|
|
|
def __init__(self, concept: Union[str, Concept], body: object):
|
|
self.concept_key = concept.key if isinstance(concept, Concept) else concept
|
|
self.concept = concept if isinstance(concept, Concept) else None
|
|
self.body = body
|
|
|
|
def __eq__(self, other):
|
|
if not isinstance(other, CB):
|
|
return False
|
|
|
|
return self.concept_key == other.concept_key and self.body == other.body
|
|
|
|
def __hash__(self):
|
|
return hash((self.concept, self.body))
|
|
|
|
def __repr__(self):
|
|
concept_debug = f"concept={self.concept}" if self.concept else f"concept_key={self.concept_key}"
|
|
return f"CB({concept_debug}, body='{self.body}')"
|
|
|
|
def transform_real_obj(self, other, get_test_obj_delegate):
|
|
if isinstance(other, CB):
|
|
return other
|
|
|
|
if isinstance(other, Concept):
|
|
concept = other.key if not self.concept else other
|
|
if isinstance(other.body, Concept):
|
|
body = get_test_obj_delegate(other.body, self.body, get_test_obj_delegate)
|
|
else:
|
|
body = other.body
|
|
return CB(concept, body)
|
|
|
|
raise NotImplementedError(f"CB, {other=}")
|
|
|
|
|
|
class CV:
|
|
"""
|
|
Concept with all values
|
|
Test class that tests all the values (not the metadata, so not the properties) of a concept
|
|
"""
|
|
|
|
def __init__(self, concept, **kwargs):
|
|
self.concept_key = concept.key if isinstance(concept, Concept) else concept
|
|
self.concept = concept if isinstance(concept, Concept) else None
|
|
self.values = {}
|
|
for k, v in kwargs.items():
|
|
if f"#{k}#" in AllConceptParts:
|
|
self.values[f"#{k}#"] = v
|
|
else:
|
|
self.values[k] = v
|
|
|
|
def __eq__(self, other):
|
|
if not isinstance(other, CV):
|
|
return False
|
|
|
|
return self.concept_key == other.concept_key and self.values == other.values
|
|
|
|
def __hash__(self):
|
|
return hash((self.concept_key, self.values))
|
|
|
|
def __repr__(self):
|
|
concept_debug = f"concept={self.concept}" if self.concept else f"concept_key={self.concept_key}"
|
|
return f"CV({concept_debug}, values={self.values})"
|
|
|
|
def transform_real_obj(self, other, get_test_obj_delegate):
|
|
if isinstance(other, CV):
|
|
return other
|
|
|
|
if isinstance(other, Concept):
|
|
concept = other.key if not self.concept else other
|
|
values = get_test_obj_delegate(other.values(), self.values, get_test_obj_delegate)
|
|
return CV(concept, **values)
|
|
|
|
raise NotImplementedError(f"CV, {other=}")
|
|
|
|
|
|
class CMV:
|
|
"""
|
|
Concept with metadata variables
|
|
CMV stands for Concept Metadata Variables
|
|
Test class that only compare the key and the metadata variables
|
|
"""
|
|
|
|
def __init__(self, concept, **kwargs):
|
|
self.concept_key = concept.key if isinstance(concept, Concept) else concept
|
|
self.concept = concept if isinstance(concept, Concept) else None
|
|
self.variables = kwargs
|
|
|
|
def __eq__(self, other):
|
|
if id(self) == id(other):
|
|
return True
|
|
|
|
if not isinstance(other, CMV):
|
|
return False
|
|
|
|
if self.concept_key != other.concept_key:
|
|
return False
|
|
|
|
return self.variables == other.variables
|
|
|
|
def __hash__(self):
|
|
if self.concept:
|
|
return hash(self.concept)
|
|
return hash(self.concept_key)
|
|
|
|
def __repr__(self):
|
|
if self.concept:
|
|
txt = f"CMV(concept='{self.concept}'"
|
|
else:
|
|
txt = f"CMV(concept_key='{self.concept_key}'"
|
|
|
|
for k, v in self.variables.items():
|
|
txt += f", {k}='{v}'"
|
|
return txt + ")"
|
|
|
|
def transform_real_obj(self, other, get_test_obj_delegate):
|
|
if isinstance(other, CMV):
|
|
return other
|
|
|
|
if isinstance(other, Concept):
|
|
concept = other.key if not self.concept else other
|
|
variables = {name: value for name, value in other.get_metadata().variables}
|
|
return CMV(concept, **variables)
|
|
|
|
raise NotImplementedError(f"CMV, {other=}")
|
|
|
|
|
|
class CIO:
|
|
"""
|
|
Concept id only
|
|
only test the id
|
|
"""
|
|
|
|
def __init__(self, concept, source=None):
|
|
if isinstance(concept, str):
|
|
self.concept_name = concept
|
|
self.concept_id = None
|
|
self.concept = None
|
|
elif isinstance(concept, Concept):
|
|
self.concept_id = concept.id
|
|
self.concept = concept
|
|
self.source = source
|
|
self.start = None
|
|
self.end = None
|
|
|
|
def set_concept(self, concept):
|
|
self.concept = concept
|
|
self.concept_id = concept.id
|
|
|
|
def __eq__(self, other):
|
|
if id(self) == id(other):
|
|
return True
|
|
|
|
if not isinstance(other, CIO):
|
|
return False
|
|
|
|
return self.concept_id == other.concept_id
|
|
|
|
def __hash__(self):
|
|
return hash(self.concept_id)
|
|
|
|
def __repr__(self):
|
|
return f"CIO(concept='{self.concept}')" if self.concept else f"CIO(name='{self.concept_name}')"
|
|
|
|
def transform_real_obj(self, other, get_test_obj_delegate):
|
|
if isinstance(other, CIO):
|
|
return other
|
|
|
|
if isinstance(other, Concept):
|
|
return CIO(other)
|
|
|
|
raise NotImplementedError(f"CIO, {other=}")
|
|
|
|
|
|
class HelperWithPos:
|
|
def __init__(self, start=None, end=None):
|
|
self.start = start
|
|
self.end = end
|
|
|
|
self.start_is_fixed = start is not None
|
|
self.end_is_fixed = end is not None
|
|
|
|
def fix_pos(self, node):
|
|
if not self.start_is_fixed:
|
|
start = node.start if hasattr(node, "start") else \
|
|
node[0] if isinstance(node, tuple) else None
|
|
|
|
if start is not None and (self.start is None or start < self.start):
|
|
self.start = start
|
|
|
|
if not self.end_is_fixed:
|
|
end = node.end if hasattr(node, "end") else \
|
|
node[1] if isinstance(node, tuple) else None
|
|
|
|
if end is not None and (self.end is None or end > self.end):
|
|
self.end = end
|
|
return self
|
|
|
|
|
|
class SCN(HelperWithPos):
|
|
"""
|
|
SourceCodeNode tester class
|
|
It matches with SourceCodeNode but with less constraints
|
|
|
|
SCN == SourceCodeNode if source, start, end (start and end are not validated when None)
|
|
"""
|
|
|
|
def __init__(self, source, start=None, end=None):
|
|
super().__init__(start, end)
|
|
self.source = source
|
|
|
|
def __eq__(self, other):
|
|
if id(self) == id(other):
|
|
return True
|
|
|
|
if isinstance(other, SourceCodeNode):
|
|
if self.source != other.source:
|
|
return False
|
|
if self.start is not None and self.start != other.start:
|
|
return False
|
|
if self.end is not None and self.end != other.end:
|
|
return False
|
|
|
|
return True
|
|
|
|
if not isinstance(other, SCN):
|
|
return False
|
|
|
|
return self.source == other.source and \
|
|
self.start == other.start and \
|
|
self.end == other.end
|
|
|
|
def __hash__(self):
|
|
return hash((self.source, self.start, self.end))
|
|
|
|
def __repr__(self):
|
|
txt = f"SCN(source='{self.source}'"
|
|
if self.start is not None:
|
|
txt += f", start={self.start}"
|
|
if self.end is not None:
|
|
txt += f", end={self.end}"
|
|
return txt + ")"
|
|
|
|
def transform_real_obj(self, other, to_compare_delegate):
|
|
"""
|
|
Transform other into CNC, to ease the comparison
|
|
:param other:
|
|
:param to_compare_delegate:
|
|
:return:
|
|
"""
|
|
|
|
if isinstance(other, SCN):
|
|
return other
|
|
|
|
if isinstance(other, SourceCodeNode):
|
|
return SCN(other.source,
|
|
other.start if self.start is not None else None,
|
|
other.end if self.end is not None else None)
|
|
|
|
raise NotImplementedError(f"SCN, {other=}")
|
|
|
|
|
|
class SCWC(HelperWithPos):
|
|
"""
|
|
SourceNodeWithConcept tester class
|
|
It matches with a SourceNodeWithConcept
|
|
but it's easier to instantiate during the tests
|
|
"""
|
|
|
|
def __init__(self, first, last, *args):
|
|
super().__init__(None, None)
|
|
self.first = first
|
|
self.last = last
|
|
self.content = list(args)
|
|
|
|
def __eq__(self, other):
|
|
if id(self) == id(other):
|
|
return True
|
|
|
|
if isinstance(other, SourceCodeWithConceptNode):
|
|
if self.first != other.first:
|
|
return False
|
|
|
|
if self.last != other.last:
|
|
return False
|
|
|
|
if len(self.content) != len(other.nodes):
|
|
return False
|
|
|
|
for self_node, other_node in zip(self.content, other.nodes):
|
|
if self_node != other_node:
|
|
return False
|
|
|
|
# at last
|
|
return True
|
|
|
|
if not isinstance(other, SCWC):
|
|
return False
|
|
|
|
return (self.start == other.start and
|
|
self.end == other.end and
|
|
self.first == other.first and
|
|
self.last == other.last and
|
|
self.content == other.content)
|
|
|
|
def __repr__(self):
|
|
txt = "SCWC("
|
|
if self.start is not None:
|
|
txt += f"start={self.start}"
|
|
if self.end is not None:
|
|
txt += f", end={self.end}"
|
|
for item in [self.first, self.last, *self.content]:
|
|
txt += f", {item}"
|
|
return txt + ")"
|
|
|
|
def transform_real_obj(self, other, get_test_obj_delegate):
|
|
"""
|
|
Transform other into CNC, to ease the comparison
|
|
:param other:
|
|
:param get_test_obj_delegate:
|
|
:return:
|
|
"""
|
|
|
|
if isinstance(other, SCWC):
|
|
return other
|
|
|
|
if isinstance(other, SourceCodeWithConceptNode):
|
|
first = get_test_obj_delegate(other.first, self.first)
|
|
last = get_test_obj_delegate(other.last, self.last)
|
|
content = [get_test_obj_delegate(r, t) for r, t in zip(other.nodes, self.content)]
|
|
res = SCWC(first, last, *content)
|
|
res.start = other.start
|
|
res.end = other.end
|
|
return res
|
|
|
|
raise NotImplementedError(f"SCWC, {other=}")
|
|
|
|
@property
|
|
def source(self):
|
|
"""
|
|
this code is a copy and paste from SourceCodeWithConceptNode.pseudo_fix_source
|
|
TODO: create a common function or whatever...
|
|
:return:
|
|
"""
|
|
source = self.first.source if hasattr(self.first, "source") else self.first
|
|
for n in self.content:
|
|
source += " "
|
|
if hasattr(n, "source"):
|
|
source += n.source
|
|
elif hasattr(n, "concept"):
|
|
source += str(n.concept)
|
|
else:
|
|
source += " unknown"
|
|
source += self.last.source if hasattr(self.last, "source") else self.last
|
|
return source
|
|
|
|
|
|
class CN(HelperWithPos):
|
|
"""
|
|
ConceptNode tester class
|
|
It matches with ConceptNode but with less constraints
|
|
|
|
CN == ConceptNode if concept key, start, end and source are the same
|
|
"""
|
|
|
|
def __init__(self, concept, source=None, start=None, end=None):
|
|
"""
|
|
|
|
:param concept: Concept or concept_key (only the key is used anyway)
|
|
:param start:
|
|
:param end:
|
|
:param source:
|
|
"""
|
|
super().__init__(start, end)
|
|
self.concept_key = concept.key if isinstance(concept, Concept) else concept
|
|
self.source = source
|
|
self.concept = concept if isinstance(concept, Concept) else None
|
|
|
|
def fix_source(self, str_tokens):
|
|
self.source = "".join(str_tokens)
|
|
return self
|
|
|
|
def __eq__(self, other):
|
|
if id(self) == id(other):
|
|
return True
|
|
|
|
if not isinstance(other, CN):
|
|
return False
|
|
|
|
return self.concept_key == other.concept_key and \
|
|
self.start == other.start and \
|
|
self.end == other.end and \
|
|
self.source == other.source
|
|
|
|
def __hash__(self):
|
|
return hash((self.concept_key, self.start, self.end, self.source))
|
|
|
|
def __repr__(self):
|
|
if self.concept:
|
|
txt = f"CN(concept='{self.concept}'"
|
|
else:
|
|
txt = f"CN(concept_key='{self.concept_key}'"
|
|
txt += f", source='{self.source}'"
|
|
if self.start is not None:
|
|
txt += f", start={self.start}"
|
|
if self.end is not None:
|
|
txt += f", end={self.end}"
|
|
return txt + ")"
|
|
|
|
def transform_real_obj(self, other, get_test_obj_delegate):
|
|
"""
|
|
Transform other into CNC, to ease the comparison
|
|
:param other:
|
|
:param get_test_obj_delegate:
|
|
:return:
|
|
"""
|
|
|
|
if isinstance(other, CN):
|
|
return other
|
|
|
|
if isinstance(other, ConceptNode):
|
|
return CN(other.concept,
|
|
other.source if self.source is not None else None,
|
|
other.start if self.start is not None else None,
|
|
other.end if self.end is not None else None)
|
|
|
|
raise NotImplementedError(f"CN, {other=}")
|
|
|
|
|
|
class CNC(CN):
|
|
"""
|
|
ConceptNode for Compiled tester class
|
|
It matches with ConceptNode
|
|
But focuses on the 'compiled' property of the concept
|
|
|
|
CNC == ConceptNode if CNC.get_compiled() == ConceptNode.concept.get_compiled()
|
|
"""
|
|
|
|
def __init__(self, concept_key, source=None, start=None, end=None, exclude_body=False, **kwargs):
|
|
super().__init__(concept_key, source, start, end)
|
|
self.compiled = kwargs
|
|
self.exclude_body = exclude_body
|
|
if "body" in self.compiled:
|
|
self.compiled[ConceptParts.BODY] = self.compiled["body"]
|
|
del self.compiled["body"]
|
|
|
|
def __eq__(self, other):
|
|
if id(self) == id(other):
|
|
return True
|
|
|
|
if not isinstance(other, CNC):
|
|
return False
|
|
|
|
return self.concept_key == other.concept_key and \
|
|
self.start == other.start and \
|
|
self.end == other.end and \
|
|
self.source == other.source and \
|
|
self.compiled == other.compiled
|
|
|
|
def __repr__(self):
|
|
if self.concept:
|
|
txt = f"CNC(concept='{self.concept}'"
|
|
else:
|
|
txt = f"CNC(concept_key='{self.concept_key}'"
|
|
txt += f", source='{self.source}'"
|
|
if self.start is not None:
|
|
txt += f", start={self.start}"
|
|
if self.end is not None:
|
|
txt += f", end={self.end}"
|
|
|
|
for k, v in self.compiled.items():
|
|
txt += f", {k}='{v}'"
|
|
return txt + ")"
|
|
|
|
def transform_real_obj(self, other, get_test_obj_delegate):
|
|
"""
|
|
Transform other into CNC, to ease the comparison
|
|
:param other:
|
|
:param get_test_obj_delegate:
|
|
:return:
|
|
"""
|
|
|
|
if isinstance(other, CNC):
|
|
return other
|
|
|
|
if isinstance(other, ConceptNode):
|
|
if self.exclude_body:
|
|
compiled = {k: v for k, v in other.concept.get_compiled().items() if k != ConceptParts.BODY}
|
|
else:
|
|
compiled = other.concept.get_compiled()
|
|
|
|
self_compile_to_use = self.compiled or compiled
|
|
|
|
compiled = get_test_obj_delegate(self_compile_to_use, compiled, get_test_obj_delegate)
|
|
return CNC(other.concept,
|
|
other.source if self.source is not None else None,
|
|
other.start if self.start is not None else None,
|
|
other.end if self.end is not None else None,
|
|
self.exclude_body,
|
|
**compiled)
|
|
|
|
raise NotImplementedError(f"CNC, {other=}")
|
|
|
|
|
|
class UTN(HelperWithPos):
|
|
"""
|
|
Tester class for UnrecognizedTokenNode
|
|
compare the source, and start, end if defined
|
|
"""
|
|
|
|
def __init__(self, source, start=None, end=None):
|
|
"""
|
|
:param source:
|
|
:param start:
|
|
:param end:
|
|
"""
|
|
super().__init__(start, end)
|
|
self.source = source
|
|
|
|
def __eq__(self, other):
|
|
if id(self) == id(other):
|
|
return True
|
|
|
|
if isinstance(other, UnrecognizedTokensNode):
|
|
return self.start == other.start and \
|
|
self.end == other.end and \
|
|
self.source == other.source
|
|
|
|
if not isinstance(other, UTN):
|
|
return False
|
|
|
|
return self.start == other.start and \
|
|
self.end == other.end and \
|
|
self.source == other.source
|
|
|
|
def __hash__(self):
|
|
return hash((self.source, self.start, self.end))
|
|
|
|
def __repr__(self):
|
|
txt = f"UTN(source='{self.source}'"
|
|
if self.start is not None:
|
|
txt += f", start={self.start}"
|
|
if self.end is not None:
|
|
txt += f", end={self.end}"
|
|
return txt + ")"
|
|
|
|
def transform_real_obj(self, other, get_test_obj_delegate):
|
|
"""
|
|
Transform other into CNC, to ease the comparison
|
|
:param other:
|
|
:param get_test_obj_delegate:
|
|
:return:
|
|
"""
|
|
|
|
if isinstance(other, UTN):
|
|
return other
|
|
|
|
if isinstance(other, UnrecognizedTokensNode):
|
|
return UTN(other.source,
|
|
other.start,
|
|
other.end)
|
|
|
|
raise NotImplementedError(f"UTN, {other=}")
|
|
|
|
|
|
class RN(HelperWithPos):
|
|
"""
|
|
Helper class to test RuleNode
|
|
"""
|
|
|
|
def __init__(self, rule, source=None, start=None, end=None):
|
|
"""
|
|
|
|
:param source:
|
|
:param start:
|
|
:param end:
|
|
"""
|
|
super().__init__(start, end)
|
|
self.rule_id = rule.id if isinstance(rule, Rule) else rule
|
|
self.source = source or str_concept((None, self.rule_id), prefix="r:") if self.rule_id else None
|
|
self.rule = rule if isinstance(rule, Rule) else None
|
|
|
|
def __eq__(self, other):
|
|
if id(self) == id(other):
|
|
return True
|
|
|
|
if not isinstance(other, RN):
|
|
return False
|
|
|
|
return self.rule_id == other.rule_id and \
|
|
self.start == other.start and \
|
|
self.end == other.end and \
|
|
self.source == other.source
|
|
|
|
def __hash__(self):
|
|
return hash((self.rule_id, self.start, self.end, self.source))
|
|
|
|
def __repr__(self):
|
|
if self.rule:
|
|
txt = f"RN(rule='{self.rule}'"
|
|
else:
|
|
txt = f"RN(rule_id='{self.rule_id}'"
|
|
txt += f", source='{self.source}'"
|
|
if self.start is not None:
|
|
txt += f", start={self.start}"
|
|
if self.end is not None:
|
|
txt += f", end={self.end}"
|
|
return txt + ")"
|
|
|
|
def transform_real_obj(self, other, get_test_obj_delegate):
|
|
"""
|
|
Transform other into CNC, to ease the comparison
|
|
:param other:
|
|
:param get_test_obj_delegate:
|
|
:return:
|
|
"""
|
|
|
|
if isinstance(other, RN):
|
|
return other
|
|
|
|
if isinstance(other, RuleNode):
|
|
return RN(other.rule,
|
|
other.source if self.source is not None else None,
|
|
other.start if self.start is not None else None,
|
|
other.end if self.end is not None else None)
|
|
|
|
raise NotImplementedError(f"RN, {other=}")
|
|
|
|
|
|
class FN:
|
|
"""
|
|
Test class only
|
|
It matches with FunctionNode but with less constraints
|
|
|
|
Thereby,
|
|
FN("first", "last", ["param1," ...]) can be compared to
|
|
FunctionNode(NameExprNode("first"), NameExprNode("second"), [FunctionParameter(NamesNodes("param1"), NamesNodes(", ")])
|
|
|
|
Note that FunctionParameter can easily be defined with a single string
|
|
* "param" -> FunctionParameter(NameExprNode("param"), None)
|
|
* "param, " -> FunctionParameter(NameExprNode("param"), NameExprNode(", "))
|
|
For more complicated situations, you can use a tuple (value, sep) to define the value part and the separator part
|
|
"""
|
|
|
|
def __init__(self, first, last, parameters):
|
|
self.first = first
|
|
self.last = last
|
|
self.parameters = []
|
|
for param in parameters:
|
|
if isinstance(param, tuple):
|
|
self.parameters.append(param)
|
|
elif isinstance(param, str) and (pos := param.find(",")) != -1:
|
|
self.parameters.append((param[:pos], param[pos:]))
|
|
else:
|
|
self.parameters.append((param, None))
|
|
|
|
def __repr__(self):
|
|
res = self.first
|
|
for param in self.parameters:
|
|
if param[1]:
|
|
res += f"{param[0]}{param[1]} "
|
|
else:
|
|
res += f"{param[0]}"
|
|
return res + self.last
|
|
|
|
def __eq__(self, other):
|
|
if id(self) == id(other):
|
|
return True
|
|
|
|
if isinstance(other, FN):
|
|
return self.first == other.first and self.last == other.last and self.parameters == other.parameters
|
|
|
|
# if isinstance(other, FunctionNode):
|
|
# if self.first != other.first.value or self.last != other.last.value:
|
|
# return False
|
|
# if len(self.parameters) != len(other.parameters):
|
|
# return False
|
|
# for self_parameter, other_parameter in zip(self.parameters, other.parameters):
|
|
# value = other_parameter.value.value if isinstance(self_parameter[0], str) else other_parameter.value
|
|
# sep = other_parameter.separator.value if other_parameter.separator else None
|
|
# if self_parameter[0] != value or self_parameter[1] != sep:
|
|
# return False
|
|
#
|
|
# return True
|
|
|
|
return False
|
|
|
|
def __hash__(self):
|
|
return hash((self.first, self.last, self.parameters))
|
|
|
|
def transform_real_obj(self, other, get_test_obj_delegate):
|
|
if isinstance(other, FN):
|
|
return other
|
|
|
|
if isinstance(other, FunctionNode):
|
|
params = []
|
|
for self_parameter, other_parameter in zip(self.parameters, other.parameters):
|
|
if isinstance(self_parameter[0], str):
|
|
value = other_parameter.value.value
|
|
else:
|
|
value = get_test_obj_delegate(other_parameter.value, self_parameter[0])
|
|
sep = other_parameter.separator.value if other_parameter.separator else None
|
|
params.append((value, sep))
|
|
|
|
return FN(other.first.value, other.last.value, params)
|
|
|
|
raise NotImplementedError(f"FN, {other=}")
|
|
|
|
|
|
comparison_type_mapping = {
|
|
"EQ": ComparisonType.EQUALS,
|
|
"NEQ": ComparisonType.NOT_EQUAlS,
|
|
"LT": ComparisonType.LESS_THAN,
|
|
"LTE": ComparisonType.LESS_THAN_OR_EQUALS,
|
|
"GT": ComparisonType.GREATER_THAN,
|
|
"GTE": ComparisonType.GREATER_THAN_OR_EQUALS,
|
|
"IN": ComparisonType.IN,
|
|
"NIN": ComparisonType.NOT_IN,
|
|
}
|
|
|
|
|
|
def get_expr_node_from_test_node(full_text, test_node):
|
|
"""
|
|
Returns EXPR, OR, NOT, AND object to ease the comparison with the real ExprNode
|
|
"""
|
|
full_text_as_tokens = list(Tokenizer(full_text, yield_eof=False))
|
|
|
|
def get_pos(nodes):
|
|
start, end = None, None
|
|
for n in nodes:
|
|
if start is None or start > n.start:
|
|
start = n.start
|
|
if end is None or end < n.end:
|
|
end = n.end
|
|
return start, end
|
|
|
|
def get_pos_from_source(source):
|
|
if isinstance(source, tuple):
|
|
source, to_skip = source[0], source[1]
|
|
else:
|
|
to_skip = 0
|
|
|
|
source_as_node = list(Tokenizer(source, yield_eof=False))
|
|
start = tokens_index(full_text_as_tokens, source_as_node, skip=to_skip)
|
|
end = start + len(source_as_node) - 1
|
|
return start, end
|
|
|
|
def get_expr_node(node):
|
|
|
|
if isinstance(node, EXPR):
|
|
value_as_tokens = list(Tokenizer(node.source, yield_eof=False))
|
|
start = tokens_index(full_text_as_tokens, value_as_tokens, 0)
|
|
end = start + len(value_as_tokens) - 1
|
|
return NameExprNode(start, end, full_text_as_tokens[start: end + 1])
|
|
|
|
if isinstance(node, AND):
|
|
parts = [get_expr_node(part) for part in node.parts]
|
|
start, end = get_pos_from_source(node.source) if node.source else get_pos(parts)
|
|
return AndNode(start, end, full_text_as_tokens[start: end + 1], *parts)
|
|
|
|
if isinstance(node, OR):
|
|
parts = [get_expr_node(part) for part in node.parts]
|
|
start, end = get_pos_from_source(node.source) if node.source else get_pos(parts)
|
|
return OrNode(start, end, full_text_as_tokens[start: end + 1], *parts)
|
|
|
|
if isinstance(node, NOT):
|
|
part = get_expr_node(node.expr)
|
|
start, end = get_pos_from_source(node.source) if node.source else (part.start - 2, part.end)
|
|
return NotNode(start, end, full_text_as_tokens[start: end + 1], part)
|
|
|
|
if isinstance(node, VAR):
|
|
value_as_tokens = list(Tokenizer(node.source or node.full_name, yield_eof=False))
|
|
start = tokens_index(full_text_as_tokens, value_as_tokens, 0)
|
|
end = start + len(value_as_tokens) - 1
|
|
parts = node.full_name.split(".")
|
|
if len(parts) == 1:
|
|
return VariableNode(start, end, full_text_as_tokens[start: end + 1], parts[0])
|
|
else:
|
|
return VariableNode(start, end, full_text_as_tokens[start: end + 1], parts[0], *parts[1:])
|
|
|
|
if isinstance(node, (EQ, NEQ, GT, GTE, LT, LTE, IN, NIN)):
|
|
node_type = comparison_type_mapping[type(node).__name__]
|
|
left_node, right_node = get_expr_node(node.left), get_expr_node(node.right)
|
|
start, end = get_pos_from_source(node.source) if node.source else get_pos([left_node, right_node])
|
|
return ComparisonNode(start, end, full_text_as_tokens[start: end + 1],
|
|
node_type, left_node, right_node)
|
|
|
|
if isinstance(node, FN):
|
|
start, end = get_pos_from_source(node.first)
|
|
first = NameExprNode(start, end, full_text_as_tokens[start: end + 1])
|
|
start, end = get_pos_from_source(node.last)
|
|
last = NameExprNode(start, end, full_text_as_tokens[start: end + 1])
|
|
parameters = []
|
|
for param_value, sep in node.parameters:
|
|
if isinstance(param_value, str):
|
|
start, end = get_pos_from_source(param_value)
|
|
param_as_expr_node = NameExprNode(start, end, full_text_as_tokens[start: end + 1])
|
|
else:
|
|
param_as_expr_node = get_expr_node(param_value)
|
|
|
|
if sep:
|
|
sep_tokens = Tokenizer(sep, yield_eof=False)
|
|
start = param_as_expr_node.end + 1
|
|
end = start + len(list(sep_tokens)) - 1
|
|
sep_as_expr_node = NameExprNode(start, end, full_text_as_tokens[start: end + 1])
|
|
else:
|
|
sep_as_expr_node = None
|
|
|
|
parameters.append(FunctionParameter(param_as_expr_node, sep_as_expr_node))
|
|
|
|
start, end = first.start, last.end
|
|
return FunctionNode(start, end, full_text_as_tokens[start: end + 1], first, last, parameters)
|
|
|
|
return get_expr_node(test_node)
|
|
|
|
|
|
def _index(tokens, expr, index):
|
|
"""
|
|
Finds a sub list in a bigger list
|
|
:param tokens:
|
|
:param expr:
|
|
:param index:
|
|
:return:
|
|
"""
|
|
expected = [token.str_value for token in Tokenizer(expr) if token.type != TokenKind.EOF]
|
|
for i in range(0, len(tokens) - len(expected) + 1):
|
|
for j in range(len(expected)):
|
|
if tokens[i + j] != expected[j]:
|
|
break
|
|
else:
|
|
if index == 0:
|
|
return i, len(expected)
|
|
else:
|
|
index -= 1
|
|
|
|
raise ValueError(f"substring '{expr}' not found")
|
|
|
|
|
|
def compute_debug_array(res):
|
|
to_compare = []
|
|
for r in res:
|
|
res_debug = []
|
|
for token in r.debug:
|
|
if isinstance(token, Token):
|
|
if token.type == TokenKind.WHITESPACE:
|
|
continue
|
|
else:
|
|
res_debug.append("T(" + token.value + ")")
|
|
else:
|
|
res_debug.append("C(" + token.concept.name + ")")
|
|
to_compare.append(res_debug)
|
|
|
|
return to_compare
|
|
|
|
|
|
def get_node(
|
|
concepts_map,
|
|
expression_as_tokens,
|
|
sub_expr,
|
|
concept_key=None,
|
|
skip=0,
|
|
is_bnf=False,
|
|
sya=False,
|
|
init_empty_body=False,
|
|
exclude_body=False):
|
|
"""
|
|
Tries to find sub in expression
|
|
When found, transform it to its correct type
|
|
:param expression_as_tokens: full expression
|
|
:param sub_expr: sub expression to search in the full expression
|
|
:param concepts_map: hash of the known concepts
|
|
:param concept_key: key of the concept if different from sub_expr
|
|
:param skip: number of occurrences of sub_expr to skip
|
|
:param is_bnf: True if the concept to search is a bnf definition
|
|
:param sya: Return SyaConceptParserHelper instead of a ConceptNode when needed
|
|
:param init_empty_body: if True adds the source in the body (actually in compiled.BODY)
|
|
:param exclude_body: Ask to not compare body
|
|
:return:
|
|
"""
|
|
if sub_expr == "')'":
|
|
return ")"
|
|
|
|
if isinstance(sub_expr, ReturnValueConcept):
|
|
return sub_expr
|
|
|
|
if isinstance(sub_expr, DoNotResolve):
|
|
return sub_expr
|
|
|
|
if isinstance(sub_expr, CIO):
|
|
sub_expr.set_concept(concepts_map[sub_expr.concept_name])
|
|
source = sub_expr.source or sub_expr.concept_name
|
|
if source:
|
|
node = get_node(concepts_map, expression_as_tokens, source, sya=sya)
|
|
sub_expr.start = node.start
|
|
sub_expr.end = node.end
|
|
return sub_expr
|
|
|
|
if isinstance(sub_expr, SCWC):
|
|
sub_expr.first = get_node(concepts_map, expression_as_tokens, sub_expr.first, sya=sya)
|
|
sub_expr.last = get_node(concepts_map, expression_as_tokens, sub_expr.last, sya=sya)
|
|
sub_expr.content = [get_node(concepts_map, expression_as_tokens, c, sya=sya) for c in sub_expr.content]
|
|
sub_expr.fix_pos(sub_expr.first)
|
|
sub_expr.fix_pos(sub_expr.last)
|
|
return sub_expr
|
|
# return SourceCodeWithConceptNode(first, last, content).pseudo_fix_source()
|
|
|
|
if isinstance(sub_expr, SCN):
|
|
node = get_node(concepts_map, expression_as_tokens, sub_expr.source, sya=sya)
|
|
sub_expr.fix_pos(node)
|
|
return sub_expr
|
|
|
|
if isinstance(sub_expr, RN):
|
|
start, length = _index(expression_as_tokens, sub_expr.source, skip)
|
|
sub_expr.start = start
|
|
sub_expr.end = start + length - 1
|
|
return sub_expr
|
|
|
|
if isinstance(sub_expr, (CNC, CC, CN)):
|
|
concept_node = get_node(
|
|
concepts_map,
|
|
expression_as_tokens,
|
|
sub_expr.source or sub_expr.concept_key,
|
|
sub_expr.concept_key, sya=sya)
|
|
if not hasattr(concept_node, "concept"):
|
|
raise Exception(f"'{sub_expr.concept_key}' is not a concept. Check your map.")
|
|
concept_found = concept_node.concept
|
|
sub_expr.concept_key = concept_found.key
|
|
sub_expr.concept = concept_found
|
|
sub_expr.fix_pos((concept_node.start, concept_node.end if hasattr(concept_node, "end") else concept_node.start))
|
|
if hasattr(sub_expr, "compiled"):
|
|
for k, v in sub_expr.compiled.items():
|
|
node = get_node(concepts_map, expression_as_tokens, v, sya=sya,
|
|
exclude_body=exclude_body) # need to get start and end positions
|
|
if isinstance(v, str) and v in concepts_map:
|
|
new_value_concept = concepts_map[v]
|
|
new_value = CC(Concept().update_from(new_value_concept), exclude_body=exclude_body)
|
|
if init_empty_body:
|
|
init_body(new_value, concept_found, v)
|
|
else:
|
|
new_value = node
|
|
|
|
sub_expr.compiled[k] = new_value
|
|
sub_expr.fix_pos(node)
|
|
if init_empty_body:
|
|
init_body(sub_expr, concept_found, sub_expr.source)
|
|
|
|
if hasattr(sub_expr, "fix_source"):
|
|
sub_expr.fix_source(expression_as_tokens[sub_expr.start: sub_expr.end + 1])
|
|
return sub_expr
|
|
|
|
if isinstance(sub_expr, UTN):
|
|
node = get_node(concepts_map, expression_as_tokens, sub_expr.source)
|
|
sub_expr.fix_pos(node)
|
|
return sub_expr
|
|
|
|
if isinstance(sub_expr, tuple):
|
|
return get_node(concepts_map, expression_as_tokens, sub_expr[0],
|
|
concept_key=concept_key, skip=sub_expr[1], is_bnf=is_bnf, sya=sya)
|
|
|
|
start, length = _index(expression_as_tokens, sub_expr, skip)
|
|
|
|
# special case of python source code
|
|
if "+" in sub_expr and sub_expr.strip() != "+":
|
|
return SCN(sub_expr, start, start + length - 1)
|
|
|
|
# try to match one of the concept from the map
|
|
concept_key = concept_key or sub_expr
|
|
concept_found = concepts_map.get(concept_key, None)
|
|
if concept_found:
|
|
concept_found = Concept().update_from(concept_found) # make a copy when massively used in tests
|
|
if sya and len(concept_found.get_metadata().variables) > 0 and not is_bnf:
|
|
return SyaConceptParserHelper(concept_found, start, start + length - 1)
|
|
elif init_empty_body:
|
|
node = CNC(concept_found, sub_expr, start, start + length - 1, exclude_body=exclude_body)
|
|
init_body(node, concept_found, sub_expr)
|
|
return node
|
|
else:
|
|
return CN(concept_found, sub_expr, start, start + length - 1)
|
|
else:
|
|
# else an UnrecognizedTokensNode
|
|
return UTN(sub_expr, start, start + length - 1)
|
|
|
|
|
|
def init_body(item, concept, value):
|
|
if "body" in item.compiled:
|
|
item.compiled[ConceptParts.BODY] = item.compiled["body"]
|
|
del (item.compiled["body"])
|
|
return
|
|
|
|
if not concept or concept.get_metadata().body or ConceptParts.BODY in item.compiled:
|
|
return
|
|
|
|
item.compiled[ConceptParts.BODY] = DoNotResolve(value)
|
|
|
|
|
|
def compute_expected_array(concepts_map, expression, expected, sya=False, init_empty_body=False, exclude_body=False):
|
|
"""
|
|
Computes a simple but sufficient version of the result of infix_to_postfix()
|
|
:param concepts_map:
|
|
:param expression:
|
|
:param expected:
|
|
:param sya: if true, generate an SyaConceptParserHelper instead of a cnode
|
|
:param init_empty_body: if True adds the source in the body (actually in compiled.BODY)
|
|
:param exclude_body: do not include ConceptParts.BODY in comparison
|
|
:return:
|
|
"""
|
|
expression_as_tokens = [token.str_value for token in Tokenizer(expression) if token.type != TokenKind.EOF]
|
|
return [get_node(
|
|
concepts_map,
|
|
expression_as_tokens,
|
|
sub_expr,
|
|
sya=sya,
|
|
init_empty_body=init_empty_body,
|
|
exclude_body=exclude_body) for sub_expr in expected]
|
|
|
|
|
|
def get_unrecognized_node(start, text):
|
|
tokens = list(Tokenizer(text, yield_eof=False))
|
|
return UnrecognizedTokensNode(start, start + len(tokens) - 1, tokens)
|
|
|
|
|
|
def get_source_code_node(start, text, concepts_map, id_manager=None):
|
|
id_manager = id_manager or CreateObjectIdentifiers()
|
|
id_mapping = {}
|
|
concept_mapping_by_id = {}
|
|
|
|
# get the concepts, mapped by their new id
|
|
for concept_name, concept in concepts_map.items():
|
|
concept_identifier = id_manager.get_identifier(concept, "__C__")
|
|
id_mapping[concept_name] = concept_identifier
|
|
concept_mapping_by_id[concept_identifier] = concept
|
|
|
|
# transform the source code to use the new id
|
|
tokens = list(Tokenizer(text, yield_eof=False))
|
|
text_to_compile_tokens = []
|
|
for t in tokens:
|
|
if t.type == TokenKind.IDENTIFIER and t.value in id_mapping:
|
|
text_to_compile_tokens.append(Token(TokenKind.IDENTIFIER, id_mapping[t.value], -1, -1, -1))
|
|
else:
|
|
text_to_compile_tokens.append(t)
|
|
text_to_compile = get_text_from_tokens(text_to_compile_tokens)
|
|
|
|
# create the python node
|
|
ast_ = ast.parse(text_to_compile, "<source>", 'eval')
|
|
python_node = PythonNode(text_to_compile, ast_, text)
|
|
python_node.objects = concept_mapping_by_id
|
|
|
|
return SourceCodeNode(start, start + len(tokens) - 1, tokens, text, python_node)
|
|
|
|
|
|
def resolve_test_concept(concept_map, hint):
|
|
if isinstance(hint, str):
|
|
return concept_map[hint]
|
|
|
|
if isinstance(hint, CC):
|
|
concept = concept_map[hint.concept_key]
|
|
compiled = {k: resolve_test_concept(concept_map, v) for k, v in hint.compiled.items()}
|
|
return CC(concept, source=hint.source, exclude_body=hint.exclude_body, **compiled)
|
|
|
|
if isinstance(hint, CMV):
|
|
concept = concept_map[hint.concept_key]
|
|
return CMV(concept, **hint.variables)
|
|
|
|
# CV
|
|
#
|
|
# CMV
|
|
#
|
|
# CIO
|
|
raise NotImplementedError()
|
|
|
|
|
|
def get_rete_conditions(*conditions_as_string):
|
|
"""
|
|
Transform a list of string into a list of Condition (Rete conditions)
|
|
:param conditions_as_string: conditions in the form 'identifier|attribute|value'
|
|
when one argument starts with "#" it means that it's a variables
|
|
ex : "#__x_00__|__name__|'__ret'" -> Condition(V('#__x_00__'), '__name__', '__ret')
|
|
|
|
Caution, the value part is evaluated
|
|
"identifier|__name__|'True'" -> Condition(identifier, '__name__', 'True') # the string 'True'
|
|
"identifier|__name__|True" -> Condition(identifier, '__name__', True) # the bool True
|
|
"""
|
|
res = []
|
|
for as_string in conditions_as_string:
|
|
identifier, attribute, value = as_string.split("|")
|
|
if identifier.startswith("#"):
|
|
identifier = V(identifier[1:])
|
|
if value.startswith("'"):
|
|
value = value[1:-1]
|
|
elif value in ("True", "False"):
|
|
value = (value == "True")
|
|
else:
|
|
value = int(value)
|
|
|
|
res.append(Condition(identifier, attribute, value))
|
|
return AndConditions(res)
|
|
|
|
|
|
def get_test_obj(real_obj, test_obj, get_test_obj_delegate=None):
|
|
"""
|
|
From a production object (Concept, ConceptNode, ....)
|
|
Create a test object (CNC, CC ...) that can be used to validate the unit tests
|
|
:param test_obj:
|
|
:param real_obj:
|
|
:param get_test_obj_delegate:
|
|
:return:
|
|
"""
|
|
if isinstance(test_obj, list):
|
|
if len(test_obj) != len(real_obj):
|
|
raise Exception(f"Not the same size ! {real_obj=}, {test_obj=}")
|
|
return [get_test_obj(r, t) for r, t in zip(real_obj, test_obj)]
|
|
|
|
if isinstance(test_obj, dict):
|
|
if len(test_obj) != len(real_obj):
|
|
raise Exception(f"Not the same size ! {real_obj=}, {test_obj=}")
|
|
|
|
return {k: get_test_obj(real_obj[k], v) for k, v in test_obj.items()}
|
|
|
|
if not hasattr(test_obj, "transform_real_obj"):
|
|
return real_obj
|
|
|
|
return test_obj.transform_real_obj(real_obj, get_test_obj)
|
|
|
|
|
|
def compare_with_test_object(actual, expected):
|
|
to_compare = get_test_obj(actual, expected)
|
|
assert to_compare == expected
|