Difference between revisions of "User:Jon Awbrey/SANDBOX"

MyWikiBiz, Author Your Legacy — Sunday November 10, 2024
Jump to navigationJump to search
Line 19: Line 19:
 
</pre>
 
</pre>
  
{| align="center" border="1" cellpadding="8" cellspacing="0" style="text-align:center; width:96%"
+
{| align="center" border="1" cellpadding="8" cellspacing="0" style="text-align:center; width:90%"
 +
|-
 +
|
 +
{| align="center" border="0" cellpadding="8" cellspacing="0" width:100%"
 +
| <math>\operatorname{Conc}^0</math>
 +
| align="center" | <math>\xrightarrow{\operatorname{Parse}}</math>
 +
| <math>\operatorname{Node}^0</math>
 +
|}
 +
|-
 
|
 
|
{| align="center" border="0" cellpadding="8" cellspacing="0" style="text-align:center; width:96%"
+
{| align="center" border="0" cellpadding="8" cellspacing="0" width:100%"
| &nbsp;
+
| <math>\operatorname{Conc}^0</math>
| From
+
| align="center" | <math>\xrightarrow{\operatorname{Parse}}</math>
| <math>(A)\!</math>
+
| <math>\operatorname{Node}^0</math>
| and
 
| <math>(\operatorname{d}A)\!</math>
 
| infer
 
| <math>(A)\!</math>
 
| next.
 
| &nbsp;
 
 
|-
 
|-
| &nbsp;
+
| <math>\operatorname{Conc}^0</math>
| From
+
| align="center" | <math>\xrightarrow{\operatorname{Parse}}</math>
| <math>(A)\!</math>
+
| <math>\operatorname{Node}^0</math>
| and
+
|}
| <math>\operatorname{d}A\!</math>
 
| infer
 
| <math>A\!</math>
 
| next.
 
| &nbsp;
 
 
|-
 
|-
| &nbsp;
+
|
| From
+
{| align="center" border="0" cellpadding="8" cellspacing="0" width:100%"
| <math>A\!</math>
+
| <math>\operatorname{Conc}^0</math>
| and
+
| align="center" | <math>\xrightarrow{\operatorname{Parse}}</math>
| <math>(\operatorname{d}A)\!</math>
+
| <math>\operatorname{Node}^0</math>
| infer
 
| <math>A\!</math>
 
| next.
 
| &nbsp;
 
 
|-
 
|-
| &nbsp;
+
| <math>\operatorname{Conc}^0</math>
| From
+
| align="center" | <math>\xrightarrow{\operatorname{Parse}}</math>
| <math>A\!</math>
+
| <math>\operatorname{Node}^0</math>
| and
 
| <math>\operatorname{d}A\!</math>
 
| infer
 
| <math>(A)\!</math>
 
| next.
 
| &nbsp;
 
 
|}
 
|}
 
|}
 
|}

Revision as of 22:30, 19 January 2009

Grammar Stuff

Table 12.  Algorithmic Translation Rules
o------------------------o---------o------------------------o
|                        |  Parse  |                        |
| Sentence in PARCE      |   -->   | Graph in PARC          |
o------------------------o---------o------------------------o
|                        |         |                        |
| Conc^0                 |   -->   | Node^0                 |
|                        |         |                        |
| Conc^k_j  S_j          |   -->   | Node^k_j  Parse(S_j)   |
|                        |         |                        |
| Surc^0                 |   -->   | Lobe^0                 |
|                        |         |                        |
| Surc^k_j  S_j          |   -->   | Lobe^k_j  Parse(S_j)   |
|                        |         |                        |
o------------------------o---------o------------------------o
\(\operatorname{Conc}^0\) \(\xrightarrow{\operatorname{Parse}}\) \(\operatorname{Node}^0\)
\(\operatorname{Conc}^0\) \(\xrightarrow{\operatorname{Parse}}\) \(\operatorname{Node}^0\)
\(\operatorname{Conc}^0\) \(\xrightarrow{\operatorname{Parse}}\) \(\operatorname{Node}^0\)
\(\operatorname{Conc}^0\) \(\xrightarrow{\operatorname{Parse}}\) \(\operatorname{Node}^0\)
\(\operatorname{Conc}^0\) \(\xrightarrow{\operatorname{Parse}}\) \(\operatorname{Node}^0\)

Table Stuff


fixy
u =
v =
1 1 0 0
1 0 1 0
= u
= v
fjuv
x =
y =
1 1 1 0
1 0 0 1
= f‹u, v›
= g‹u, v›


A
u =
v =
1 1 0 0
1 0 1 0
= u
= v
B
x =
y =
1 1 1 0
1 0 0 1
= f‹u, v›
= g‹u, v›


u =
v =
1 1 0 0
1 0 1 0
= u
= v
x =
y =
1 1 1 0
1 0 0 1
= f‹u, v›
= g‹u, v›


u =
v =
x =
y =
1 1 0 0
1 0 1 0
1 1 1 0
1 0 0 1
= u
= v
= f‹u, v›
= g‹u, v›