Commit: be541e58affa82256baba6e1a93d0fa01f1d6cb6 - CCastle2 (hg)

Castle: The best Real-Time/Embedded/HighTech language EVER. Attempt 2

Commit MetaInfo

• Revisão: be541e58affa82256baba6e1a93d0fa01f1d6cb6 (tree)
• Hora: 2022-04-20 21:34:01
• Autor: Albert Mietus < albert AT mietus DOT nl >
• Commiter: Albert Mietus < albert AT mietus DOT nl >

Mensagem de Log

Removed onld DEMO file

Mudança Sumário

• delete: demos/readers/parser/__init__.py
• delete: demos/readers/parser/test_Rule.py

Diff

diff -r 8630266187d0 -r be541e58affa demos/readers/parser/test_Rule.py
--- a/demos/readers/parser/test_Rule.py	Tue Apr 19 16:59:48 2022 +0200
+++ /dev/null	Thu Jan 01 00:00:00 1970 +0000
@@ -1,62 +0,0 @@
-import pytest
-import logging;logger = logging.getLogger(__name__)
-
-from castle.readers.parser import grammar
-
-import arpeggio
-
-def format_node(n):
-    return f"\tNODE:: {n!r}:{type(n)}"
-
-def format_children(l):
-    if l is None: return "~~~Forget to pass children~~~"
-    if len(l)<1:  return "\tCHILDREN: None"
-    return ("\n\tCHILDREN::" + ", ".join(f'>>{c}<<' for c in l))
-
-def show_visited(label="VISIT_", node=None, children=None):
-    nl= "\n" if label[-1] != '_' else ""
-    logger.info(f'{label}{nl}{format_node(node)}{format_children(children)}')
-
-
-
-class DemoVisitor(arpeggio.PTNodeVisitor):
-    def visit__default__(self, node, children):
-        show_visited('visit__default__', node, children)
-        return (node, children)
-    def visit_rule(self, node, children):
-        show_visited('visit_rule', node, children)
-        return (node, children)
-    def visit_ordered_choice(self, node, children):
-        show_visited('ordered_choice', node, children)
-        return (node, children)
-
-    def visit_rule_name(self, node, children):
-        show_visited('VISIT_rule_name', node, children)
-        return (node, children)
-    def visit_rule_crossref(self, node, children):
-        show_visited('VISIT_rule_crossref', node, children)
-        return (node, children)
-
-
-
-def _test_Rule():
-    TXT= """RULE_NAME <- EXP1 EXP2 ;"""
-    parse_tree = arpeggio.ParserPython(language_def=grammar.rule).parse(TXT)
-
-    print("\nPARSE-TREE\n" + parse_tree.tree_str()+'\n')
-
-    ast = arpeggio.visit_parse_tree(parse_tree, DemoVisitor())
-    print("\nAST:\t" + ast)
-
-
-def QAZ(txt, rule, label=None):
-    if label: print(f'\nLABEL: {label}')
-    parse_tree = arpeggio.ParserPython(language_def=rule).parse(txt)
-    print("PARSE-TREE\n" + parse_tree.tree_str()+'\n')
-
-    ast = arpeggio.visit_parse_tree(parse_tree, DemoVisitor())
-    print("AST:\t",  ast)
-
-def test_QAZ_rule_name():    	QAZ("""aName""",	grammar.rule_name,	label="rule_name")
-def test_QAZ_rule_crossref():	QAZ("""aName""",	grammar.rule_crossref,	label="rule_crossref")
-def test_QAZ_expression():	QAZ("""aName""",	grammar.expression,	label="expression")