Debian Codegraph @

Tools/peg_generator/pegen/grammar_visualizer.py

raw
1 import argparse
2 import sys
3 from collections.abc import Callable, Iterator
4 from typing import Any
5
6 from pegen.build import build_parser
7 from pegen.grammar import Grammar, Rule
8
9 argparser = argparse.ArgumentParser(
10 prog="pegen", description="Pretty print the AST for a given PEG grammar"
11 )
12 argparser.add_argument("filename", help="Grammar description")
13
14
15 class ASTGrammarPrinter:
16 def children(self, node: Rule) -> Iterator[Any]:
17 for value in node:
18 if isinstance(value, list):
19 yield from value
20 else:
21 yield value
22
23 def name(self, node: Rule) -> str:
24 if not list(self.children(node)):
25 return repr(node)
26 return node.__class__.__name__
27
28 def print_grammar_ast(self, grammar: Grammar, printer: Callable[..., None] = print) -> None:
29 for rule in grammar.rules.values():
30 printer(self.print_nodes_recursively(rule))
31
32 def print_nodes_recursively(self, node: Rule, prefix: str = "", istail: bool = True) -> str:
33 children = list(self.children(node))
34 value = self.name(node)
35
36 line = prefix + ("└──" if istail else "├──") + value + "\n"
37 sufix = " " if istail else "│ "
38
39 if not children:
40 return line
41
42 *children, last = children
43 for child in children:
44 line += self.print_nodes_recursively(child, prefix + sufix, False)
45 line += self.print_nodes_recursively(last, prefix + sufix, True)
46
47 return line
48
49
50 def main() -> None:
51 args = argparser.parse_args()
52
53 try:
54 grammar, parser, tokenizer = build_parser(args.filename)
55 except Exception as err:
56 print("ERROR: Failed to parse grammar file", err, file=sys.stderr)
57 sys.exit(1)
58
59 visitor = ASTGrammarPrinter()
60 visitor.print_grammar_ast(grammar)
61
62
63 if __name__ == "__main__":
64 main()