提交: 5979095e73bd13d12dbaee2fa6278bdc3b3ec8bb - CCastle2 (hg)

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

Commit MetaInfo

• 修订版: 5979095e73bd13d12dbaee2fa6278bdc3b3ec8bb (tree)
• 时间: 2021-12-11 04:45:25
• 作者: Albert Mietus < albert AT mietus DOT nl >
• Commiter: Albert Mietus < albert AT mietus DOT nl >

Log Message

Arpeggio:: Added a pytest as demo of PTNodeVisitor -- Not an AST yet

更改概述

• add: Arpeggio/demo/__init__.py
• add: Arpeggio/demo/test_Rule.py

差异

diff -r c96d582a07d7 -r 5979095e73bd Arpeggio/demo/test_Rule.py
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/Arpeggio/demo/test_Rule.py	Fri Dec 10 20:45:25 2021 +0100
@@ -0,0 +1,60 @@
+import pytest
+
+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 ""
+    print(f'XXX {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_expressions():	QAZ("""aName""",	grammar.expressions,	label="expressions")