def build_tree (cls, tokens):
# Поиск главного понятия действия
idx = 0
node = None
root_node = None
for token in tokens:
if token.type == TokenType.concept:
if token.concept.type == TokenConceptType.action:
node = PropositionTreeNode ()
node.text = token.text
node.type = PropositionTreeNodeType.concept
node.side = PropositionTreeNodeSide.center
node.concept = TreeNodeConcept ()
node.concept.id = token.concept.id
node.concept.name = token.concept.name
node.concept.type = token.concept.type
root_node = node
break
idx += 1
if node == None:
cls.__error_text = ErrorHelper.get_text (101)
return None
# Обработка левой ветки суждения
i = idx - 1
while i >= 0:
if tokens[i].type == TokenType.equal_sign:
if tokens[i+1].type == TokenType.concept:
node.concept.sublink = True
else:
parent_node = node
node = PropositionTreeNode ()
node.parent = parent_node
node.text = tokens[i].text
if tokens[i].type == TokenType.concept:
node.type = PropositionTreeNodeType.concept
node.side = PropositionTreeNodeSide.left
node.concept = TreeNodeConcept ()
node.concept.id = tokens[i].concept.id
node.concept.name = tokens[i].concept.name
node.concept.type = tokens[i].concept.type
elif tokens[i].type == TokenType.linkage:
node.type = PropositionTreeNodeType.linkage
node.side = PropositionTreeNodeSide.left
node.linkage = TreeNodeLinkage ()
node.linkage.id = tokens[i].linkage.id
node.linkage.name = tokens[i].linkage.name
elif tokens[i].type == TokenType.underscore:
node.type = PropositionTreeNodeType.underscore
elif tokens[i].type == TokenType.number:
node.type = PropositionTreeNodeType.number
elif tokens[i].type == TokenType.string:
node.type = PropositionTreeNodeType.string
#print node.text
parent_node.children.append (node)
i -= 1
# Обработка правой ветки суждения
i = idx + 1
node = root_node
level_inside_brackets = 0
common_parent = None
while i < len (tokens):
if tokens[i].type == TokenType.point:
pass
elif tokens[i].type == TokenType.question_mark:
pass
elif tokens[i].type == TokenType.opening_bracket:
level_inside_brackets += 1
if node.type == PropositionTreeNodeType.concept:
if level_inside_brackets > 1:
cls.__push_common_parent (common_parent)
common_parent = node
elif node.type == PropositionTreeNodeType.linkage:
b = 1
subtree_tokens = []
j = i + 1
while j < len (tokens) and b != 0:
if tokens[j].type == TokenType.opening_bracket:
b += 1
if tokens[j].type == TokenType.closing_bracket:
b -= 1
if b != 0:
subtree_tokens.append (tokens[j])
j += 1
subtree_rootnode = cls.build_tree (subtree_tokens)
subtree_rootnode.concept.subroot = True
if node != None:
node.children.append (subtree_rootnode)
else:
return None
i = j - 1
elif tokens[i].type == TokenType.closing_bracket:
level_inside_brackets -= 1
common_parent = cls.__pop_common_parent ()
elif tokens[i].type == TokenType.comma:
if level_inside_brackets > 0:
node = common_parent
elif tokens[i].type == TokenType.equal_sign:
pass
else:
parent_node = node
node = PropositionTreeNode ()
node.parent = parent_node
node.text = tokens[i].text
if tokens[i].type == TokenType.concept:
node.type = PropositionTreeNodeType.concept
node.side = PropositionTreeNodeSide.right
node.concept = TreeNodeConcept ()
node.concept.id = tokens[i].concept.id
node.concept.name = tokens[i].concept.name
node.concept.type = tokens[i].concept.type
elif tokens[i].type == TokenType.linkage:
node.type = PropositionTreeNodeType.linkage
node.side = PropositionTreeNodeSide.right
node.linkage = TreeNodeLinkage ()
node.linkage.id = tokens[i].linkage.id
node.linkage.name = tokens[i].linkage.name
elif tokens[i].type == TokenType.underscore:
node.type = PropositionTreeNodeType.underscore
elif tokens[i].type == TokenType.number:
node.type = PropositionTreeNodeType.number
elif tokens[i].type == TokenType.string:
node.type = PropositionTreeNodeType.string
elif tokens[i].type == TokenType.code_object:
node.type = PropositionTreeNodeType.code_object
#print node.text
parent_node.children.append (node)
i += 1
return root_node
def replace_subtree (cls, root_node, side, is_new, cursor):
actor, actant = PropositionTree.get_actor_and_actant (root_node)
result_node = PropositionTreeNode ()
result_node.type = PropositionTreeNodeType.concept
result_node.side = side
result_node.concept = TreeNodeConcept ()
is_memobject = False
error_text = ""
if root_node.concept.name == LanguageHelper.translate ("to-have"):
if actant.concept.name == LanguageHelper.translate ("name"):
if actor.concept.name == LanguageHelper.translate ("module"):
child1 = actant.children[0]
if child1.type == PropositionTreeNodeType.linkage:
if child1.linkage.name == LanguageHelper.translate ("which"):
child2 = child1.children[0]
if child2.type == PropositionTreeNodeType.concept:
result_node.concept.type = TreeNodeConceptType.module
result_node.concept.name = child2.concept.name
result_node.text = result_node.concept.name
is_memobject = True
elif actor.concept.name == LanguageHelper.translate ("field"):
child1 = actant.children[0]
if child1.type == PropositionTreeNodeType.linkage:
if child1.linkage.name == LanguageHelper.translate ("which"):
child2 = child1.children[0]
if child2.type == PropositionTreeNodeType.code_object:
if is_new == True:
result_node.concept.id = MemoryProvider.create_field (child2.text)
is_memobject = True
result_node.concept.type = TreeNodeConceptType.field
result_node.concept.name = "$" + str (result_node.concept.id)
result_node.text = result_node.concept.name
ContextProvider.set_field_node (result_node)
else:
result_node.concept.id = MemoryProvider.get_field_id (child2.text)
is_memobject = True
result_node.concept.type = TreeNodeConceptType.field
result_node.concept.name = "$" + str (result_node.concept.id)
result_node.text = result_node.concept.name
elif actor.concept.name == LanguageHelper.translate ("constant"):
child1 = actant.children[0]
if child1.type == PropositionTreeNodeType.linkage:
if child1.linkage.name == LanguageHelper.translate ("which"):
child2 = child1.children[0]
if child2.type == PropositionTreeNodeType.code_object:
if is_new == True:
result_node.concept.id = MemoryProvider.create_constant (child2.text)
is_memobject = True
result_node.concept.type = TreeNodeConceptType.constant
result_node.concept.name = "$" + str (result_node.concept.id)
result_node.text = result_node.concept.name
ContextProvider.set_constant_node (result_node)
else:
result_node.concept.id = MemoryProvider.get_constant_id (child2.text)
is_memobject = True
result_node.concept.type = TreeNodeConceptType.constant
result_node.concept.name = "$" + str (result_node.concept.id)
result_node.text = result_node.concept.name
elif actor.concept.name == LanguageHelper.translate ("list"):
child1 = actant.children[0]
if child1.type == PropositionTreeNodeType.linkage:
if child1.linkage.name == LanguageHelper.translate ("which"):
child2 = child1.children[0]
if child2.type == PropositionTreeNodeType.code_object:
if is_new == True:
result_node.concept.id = MemoryProvider.create_list (child2.text)
is_memobject = True
result_node.concept.type = TreeNodeConceptType.memlist
result_node.concept.name = "$" + str (result_node.concept.id)
result_node.text = result_node.concept.name
ContextProvider.set_list_node (result_node)
else:
result_node.concept.id = MemoryProvider.get_list_id (child2.text)
is_memobject = True
result_node.concept.type = TreeNodeConceptType.memlist
result_node.concept.name = "$" + str (result_node.concept.id)
result_node.text = result_node.concept.name
elif actor.concept.name == LanguageHelper.translate ("trigger"):
child1 = actant.children[0]
if child1.type == PropositionTreeNodeType.linkage:
if child1.linkage.name == LanguageHelper.translate ("which"):
child2 = child1.children[0]
if child2.type == PropositionTreeNodeType.code_object:
if is_new == True:
result_node.concept.id = TriggerProvider.create_trigger (child2.text)
result_node.concept.type = TreeNodeConceptType.trigger
result_node.concept.name = "$" + str (result_node.concept.id)
result_node.text = result_node.concept.name
ContextProvider.set_trigger_node (result_node)
elif actor.concept.name == LanguageHelper.translate ("condition"):
child1 = actant.children[0]
if child1.type == PropositionTreeNodeType.linkage:
if child1.linkage.name == LanguageHelper.translate ("which"):
child2 = child1.children[0]
if child2.type == PropositionTreeNodeType.code_object:
if is_new == True:
result_node.concept.id = ConditionProvider.create_condition (child2.text)
result_node.concept.type = TreeNodeConceptType.condition
result_node.concept.name = "$" + str (result_node.concept.id)
result_node.text = result_node.concept.name
ContextProvider.set_condition_node (result_node)
elif child2.type == PropositionTreeNodeType.concept:
if is_new == True:
result_node.concept.id = ConditionProvider.create_condition (child2.text)
result_node.concept.type = TreeNodeConceptType.condition
result_node.concept.name = "$" + str (result_node.concept.id)
result_node.text = result_node.concept.name
ContextProvider.set_condition_node (result_node)
elif actor.concept.name == LanguageHelper.translate ("procedure"):
child1 = actant.children[0]
if child1.type == PropositionTreeNodeType.linkage:
if child1.linkage.name == LanguageHelper.translate ("which"):
child2 = child1.children[0]
if child2.type == PropositionTreeNodeType.concept:
database_triad = DatabaseTriad.read (cursor, actant.concept.id, child1.linkage.id, child2.concept.id)
if database_triad == None:
error_text = ErrorHelper.get_text (105)
return None, error_text
database_sequense1 = DatabaseSequence.read (cursor, 0, 0, database_triad.id)
if database_sequense1 == None:
error_text = ErrorHelper.get_text (105)
return None, error_text
database_triad = DatabaseTriad.read_by_id (cursor, database_sequense1.left_triad_id)
if database_triad == None:
error_text = ErrorHelper.get_text (105)
return None, error_text
if database_triad.left_concept_id == root_node.concept.id:
database_sequense2 = DatabaseSequence.read (cursor, database_sequense1.proposition_id, 0, database_triad.id)
if database_sequense2 == None:
error_text = ErrorHelper.get_text (105)
return None, error_text
database_triad = DatabaseTriad.read_by_id (cursor, database_sequense2.left_triad_id)
if database_triad == None:
error_text = ErrorHelper.get_text (105)
return None, error_text
result_node.concept.id = database_triad.left_concept_id
database_concept = DatabaseConcept.read_by_name (cursor, LanguageHelper.translate ("to-be"))
if database_concept == None:
error_text = ErrorHelper.get_text (104)
return None, error_text
database_triad1 = DatabaseTriad.read (cursor, result_node.concept.id, 0, database_concept.id)
if database_triad1 == None:
error_text = ErrorHelper.get_text (104)
return None, error_text
database_triad2 = DatabaseTriad.read (cursor, database_concept.id, 0, actor.concept.id)
if database_triad2 == None:
error_text = ErrorHelper.get_text (104)
return None, error_text
database_sequense3 = DatabaseSequence.read (cursor, 0, database_triad1.id, database_triad2.id)
if database_sequense3 == None:
error_text = ErrorHelper.get_text (104)
return None, error_text
else:
error_text = ErrorHelper.get_text (105)
return None, error_text
elif actant.concept.name == LanguageHelper.translate ("class"):
if actor.concept.name == LanguageHelper.translate ("trigger"):
child1 = actant.children[0]
if child1.type == PropositionTreeNodeType.linkage:
if child1.linkage.name == LanguageHelper.translate ("which"):
child2 = child1.children[0]
if child2.type == PropositionTreeNodeType.string:
result_node.concept.id = TriggerProvider.get_id_by_class (child2.text)
result_node.concept.type = TreeNodeConceptType.trigger
result_node.concept.name = "$" + str (result_node.concept.id)
result_node.text = result_node.concept.name
is_memobject = True
if is_memobject != True:
if result_node.concept.id != 0:
database_concept = DatabaseConcept.read_by_id (cursor, result_node.concept.id)
result_node.concept.type = database_concept.type
result_node.concept.name = database_concept.name
result_node.text = result_node.concept.name
else:
return None, error_text
return result_node, error_text
def build_tree(cls, tokens):
# Поиск главного понятия действия
idx = 0
node = None
root_node = None
for token in tokens:
if token.type == TokenType.concept:
if token.concept.type == TokenConceptType.action:
node = PropositionTreeNode()
node.text = token.text
node.type = PropositionTreeNodeType.concept
node.side = PropositionTreeNodeSide.center
node.concept = TreeNodeConcept()
node.concept.id = token.concept.id
node.concept.name = token.concept.name
node.concept.type = token.concept.type
root_node = node
break
idx += 1
if node == None:
cls.__error_text = ErrorHelper.get_text(101)
return None
# Обработка левой ветки суждения
i = idx - 1
while i >= 0:
if tokens[i].type == TokenType.equal_sign:
if tokens[i + 1].type == TokenType.concept:
node.concept.sublink = True
else:
parent_node = node
node = PropositionTreeNode()
node.parent = parent_node
node.text = tokens[i].text
if tokens[i].type == TokenType.concept:
node.type = PropositionTreeNodeType.concept
node.side = PropositionTreeNodeSide.left
node.concept = TreeNodeConcept()
node.concept.id = tokens[i].concept.id
node.concept.name = tokens[i].concept.name
node.concept.type = tokens[i].concept.type
elif tokens[i].type == TokenType.linkage:
node.type = PropositionTreeNodeType.linkage
node.side = PropositionTreeNodeSide.left
node.linkage = TreeNodeLinkage()
node.linkage.id = tokens[i].linkage.id
node.linkage.name = tokens[i].linkage.name
elif tokens[i].type == TokenType.underscore:
node.type = PropositionTreeNodeType.underscore
elif tokens[i].type == TokenType.number:
node.type = PropositionTreeNodeType.number
elif tokens[i].type == TokenType.string:
node.type = PropositionTreeNodeType.string
#print node.text
parent_node.children.append(node)
i -= 1
# Обработка правой ветки суждения
i = idx + 1
node = root_node
level_inside_brackets = 0
common_parent = None
while i < len(tokens):
if tokens[i].type == TokenType.point:
pass
elif tokens[i].type == TokenType.question_mark:
pass
elif tokens[i].type == TokenType.opening_bracket:
level_inside_brackets += 1
if node.type == PropositionTreeNodeType.concept:
if level_inside_brackets > 1:
cls.__push_common_parent(common_parent)
common_parent = node
elif node.type == PropositionTreeNodeType.linkage:
b = 1
subtree_tokens = []
j = i + 1
while j < len(tokens) and b != 0:
if tokens[j].type == TokenType.opening_bracket:
b += 1
if tokens[j].type == TokenType.closing_bracket:
b -= 1
if b != 0:
subtree_tokens.append(tokens[j])
j += 1
subtree_rootnode = cls.build_tree(subtree_tokens)
subtree_rootnode.concept.subroot = True
if node != None:
node.children.append(subtree_rootnode)
else:
return None
i = j - 1
elif tokens[i].type == TokenType.closing_bracket:
level_inside_brackets -= 1
common_parent = cls.__pop_common_parent()
elif tokens[i].type == TokenType.comma:
if level_inside_brackets > 0:
node = common_parent
elif tokens[i].type == TokenType.equal_sign:
pass
else:
parent_node = node
node = PropositionTreeNode()
node.parent = parent_node
node.text = tokens[i].text
if tokens[i].type == TokenType.concept:
node.type = PropositionTreeNodeType.concept
node.side = PropositionTreeNodeSide.right
node.concept = TreeNodeConcept()
node.concept.id = tokens[i].concept.id
node.concept.name = tokens[i].concept.name
node.concept.type = tokens[i].concept.type
elif tokens[i].type == TokenType.linkage:
node.type = PropositionTreeNodeType.linkage
node.side = PropositionTreeNodeSide.right
node.linkage = TreeNodeLinkage()
node.linkage.id = tokens[i].linkage.id
node.linkage.name = tokens[i].linkage.name
elif tokens[i].type == TokenType.underscore:
node.type = PropositionTreeNodeType.underscore
elif tokens[i].type == TokenType.number:
node.type = PropositionTreeNodeType.number
elif tokens[i].type == TokenType.string:
node.type = PropositionTreeNodeType.string
elif tokens[i].type == TokenType.code_object:
node.type = PropositionTreeNodeType.code_object
#print node.text
parent_node.children.append(node)
i += 1
return root_node