jinx/python-uncompyle6
1
Fork 0
mirror of https://github.com/rocky/python-uncompyle6.git synced 2025-08-04 01:09:52 +08:00
Code Issues Packages Projects Releases Wiki Activity

More table doc tweaks

Browse Source
This commit is contained in:
rocky
2017-10-03 11:36:25 -04:00
parent 86305097d2
commit 9e2119f1a9
1 changed files with 11 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
uncompyle6/semantics/pysource.py
View File

@@ -25,7 +25,7 @@ Python.
# of the nonterminal is suffixed with "_exit" it will be called after # of the nonterminal is suffixed with "_exit" it will be called after
# all of its children are called. # all of its children are called.
# #
# After a while writing methods this way, you'll find many routines which do similar w# After a while writing methods this way, you'll find many routines which do similar
# sorts of things, and soon you'll find you want a short notation to # sorts of things, and soon you'll find you want a short notation to
# describe rules and not have to create methods at all. # describe rules and not have to create methods at all.
# #
@@ -43,8 +43,10 @@ Python.
# We allow for a couple of ways to interact with a node in a tree. So # We allow for a couple of ways to interact with a node in a tree. So
# step 1 after not seeing a custom method for a nonterminal is to # step 1 after not seeing a custom method for a nonterminal is to
# determine from what point of view tree-wise the rule is applied. # determine from what point of view tree-wise the rule is applied.
# In the diagram below, "N" is a nonterminal name, and K is the table
# key name; we show where those are with respect to each other in the # In the diagram below, N is a nonterminal name, and K also a nonterminal
# name but the one used as a key in the table.
# we show where those are with respect to each other in the
# AST tree for N. # AST tree for N.
# #
# #
@@ -55,12 +57,14 @@ Python.
# K # K
# TABLE_DIRECT TABLE_R TABLE_R0 # TABLE_DIRECT TABLE_R TABLE_R0
# #
# The default is a "TABLE_DIRECT" mapping By far, most rules used work this way. # The default table is TABLE_DIRECT mapping By far, most rules used work this way.
# TABLE_R0 is rarely used. # TABLE_R0 is rarely used.
# #
# The key K is then extracted from the # The key K is then extracted from the subtree and used to find one
# subtree and used to find a table entry T[K], if any. The result is a # of the tables, T listed above. The result after applying T[K] is
# format string and arguments (a la printf()) for the formatting engine. # a format string and arguments (a la printf()) for the formatting
# engine.
#
# Escapes in the format string are: # Escapes in the format string are:
# #
# %c evaluate the node recursively. Its argument is a single # %c evaluate the node recursively. Its argument is a single