245
edits
Difference between revisions of "SCI/Specifications/SCI in action/Parser"
SCI/Specifications/SCI in action/Parser (view source)
Revision as of 00:04, 19 January 2009
, 00:04, 19 January 2009Merging of the SCI documentation. Work in progress.
(Merging of the SCI documentation. Work in progress.) |
(Merging of the SCI documentation. Work in progress.) |
||
| Line 544: | Line 544: | ||
} | } | ||
</syntax> | </syntax> | ||
==Matching the trees== | |||
The exact algorithm used to compare <i>T</i><sub>π</sub> to <i>T</i><sub>Σ</sub> is not known yet. The one described here is based on the approximation used in FreeSCI, which is very similar to the original SCI one. | |||
First, we need to describe a set of functions for traversing the nodes of <i>T</i><sub>Σ</sub> and <i>T</i><sub>π</sub> , and doing some work. They will be operating on the sets ℕ (all non-negative integral numbers), 𝔹 (Booleans), and <i>NODE</i> (which we defined earlier). | |||
==Notes== | ==Notes== | ||
<references/> | <references/> | ||