12,080
edits
Changes
Directory:Jon Awbrey/Papers/Futures Of Logical Graphs (view source)
Revision as of 04:00, 28 July 2009
, 04:00, 28 July 2009→Introduction: convert graphics
In the case of our last example, a moment's contemplation of the following picture will lead us to see that we can get the corresponding parenthesis string by starting at the root of the tree, climbing up the left side of the tree until we reach the top, then climbing back down the right side of the tree until we return to the root, all the while reading off the symbols, in this particular case either "(" or ")", that we happen to encounter in our travels.
In the case of our last example, a moment's contemplation of the following picture will lead us to see that we can get the corresponding parenthesis string by starting at the root of the tree, climbing up the left side of the tree until we reach the top, then climbing back down the right side of the tree until we return to the root, all the while reading off the symbols, in this particular case either "(" or ")", that we happen to encounter in our travels.
{| align="center" cellpadding="10"
| [[Image:Logical_Graph_Figure_6_Visible_Frame.jpg|500px]]
| ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` |
|}
| ` ` ` ` ` ` ` ` (( )) ` ` ` = ` ` ` ` ` ` ` ` ` ` ` ` ` ` |
| ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` ` |
This ritual is called ''traversing'' the tree, and the string read off is often called the ''traversal string'' of the tree. The reverse ritual, that passes from the string to the tree, is called ''parsing'' the string, and the tree constructed is often called the ''parse graph'' of the string. I tend to be a bit loose in this language, often using ''parse string'' to mean the string that gets parsed into the associated graph.
This ritual is called ''traversing'' the tree, and the string read off is often called the ''traversal string'' of the tree. The reverse ritual, that passes from the string to the tree, is called ''parsing'' the string, and the tree constructed is often called the ''parse graph'' of the string. I tend to be a bit loose in this language, often using ''parse string'' to mean the string that gets parsed into the associated graph.