1,079
edits
m (Forgot to remove the "WIP") |
m (→Said specs: fix invalid usage of <syntax>) |
||
Line 450: | Line 450: | ||
This sequence of operators and word groups is now used to build the Said tree <i>T</i><sub>Σ</sub> . I will describe the algorithm used to generate <i>T</i><sub>Σ</sub> by providing a grammar <i>G</i><sub>Σ</sub> , with <i>L(G<sub>Σ</sub>) </i>containing all valid Said specs. The semantics will be provided under each rule with a double arrow: | This sequence of operators and word groups is now used to build the Said tree <i>T</i><sub>Σ</sub> . I will describe the algorithm used to generate <i>T</i><sub>Σ</sub> by providing a grammar <i>G</i><sub>Σ</sub> , with <i>L(G<sub>Σ</sub>) </i>containing all valid Said specs. The semantics will be provided under each rule with a double arrow: | ||
< | <pre> | ||
G\Sigma = ({saidspec, optcont, leftspec, midspec, rightspec, word, cwordset, wordset, expr, cwordrefset, wordrefset, recref}, \Gamma, P, saidspec) | G\Sigma = ({saidspec, optcont, leftspec, midspec, rightspec, word, cwordset, wordset, expr, cwordrefset, wordrefset, recref}, \Gamma, P, saidspec) | ||
Line 541: | Line 541: | ||
\Rightarrow (141 144 (144 14f wordset)) | \Rightarrow (141 144 (144 14f wordset)) | ||
} | } | ||
</ | </pre> | ||
==Matching the trees== | ==Matching the trees== |
edits