Implemented a first and basic version of a Rete rule engine

src/parsers/FunctionParser.py

@@ -44,9 +44,15 @@ class NamesNode(FunctionParserNode):
         return "".join([t.str_value for t in self.tokens])
 
     def to_unrecognized(self):
+        """
+        UnrecognizedTokensNode with all tokens
+        """
         return UnrecognizedTokensNode(self.start, self.end, self.tokens).fix_source()
 
     def to_str_unrecognized(self):
+        """
+        UnrecognizedTokensNode with one token, which is a string token of all the tokens
+        """
         token = Token(TokenKind.STRING,
                       "'" + self.str_value() + "'",
                       self.tokens[0].index,
@@ -342,6 +348,7 @@ class FunctionParser(BaseParser):
 
         res = [SourceCodeWithConceptNode(function_node.first.to_unrecognized(), function_node.last.to_unrecognized())]
 
+        # try to recognize every parameter, one by one
         for param in function_node.parameters:
             if isinstance(param.value, NamesNode):
                 # try to recognize concepts