T-rule: Difference between revisions
From UNLwiki
Jump to navigationJump to search
imported>Martins No edit summary |
imported>Martins No edit summary |
||
| Line 2: | Line 2: | ||
<INITIAL STATE>:=<FINAL STATE>; | <INITIAL STATE>:=<FINAL STATE>; | ||
And may be classified according to the type of modification that they promote: | And may be classified according to the type of modification that they promote: | ||
*LL, or list-to-list, | *LL, or list-to-list, where the initial state and the final state are list structures | ||
*TT, or tree-to-tree, | *TT, or tree-to-tree, where the initial state and the final state are tree structures | ||
*NN, or network-to-network, | *NN, or network-to-network, where the initial state and the final state are network structures | ||
*LT, or list-to-tree, converts lists into trees | *LT, or list-to-tree, converts lists into trees | ||
*TL, or tree-to-list, converts trees into lists | *TL, or tree-to-list, converts trees into lists | ||
*TN, or tree-to-networks, converts trees into networks | *TN, or tree-to-networks, converts trees into networks | ||
*NT, or network-to-trees, converts networks into trees | *NT, or network-to-trees, converts networks into trees | ||
Revision as of 21:06, 2 August 2012
T-rules, or transformation rules, are rules that alter the state of the machine. As describe in the UNL Grammar Specs, they follow the general formalism:
<INITIAL STATE>:=<FINAL STATE>;
And may be classified according to the type of modification that they promote:
- LL, or list-to-list, where the initial state and the final state are list structures
- TT, or tree-to-tree, where the initial state and the final state are tree structures
- NN, or network-to-network, where the initial state and the final state are network structures
- LT, or list-to-tree, converts lists into trees
- TL, or tree-to-list, converts trees into lists
- TN, or tree-to-networks, converts trees into networks
- NT, or network-to-trees, converts networks into trees
