| |
| | wikien.info: Main_Page (Site not responding. Last check: 2007-07-21) |
 | | Generative formal grammars are identical to Lindenmayer system s (L-systems), except that L-systems are not affected by a distinction between terminals and nonterminals, L-systems have restrictions on the order in which the rules are applied, and L-systems can run forever, generating an infinite sequence of strings. |
 | | In regular grammar s, the left hand side is again only a single non-terminal symbol, but now the right-hand side is also restricted: It may be nothing, or a single terminal symbol, or a single terminal symbol followed by a non-terminal symbol, but nothing else. |
 | | Affix Grammars and attribute grammar s allow rewrite rules to be augmented with semantic attributes and operations, useful both for increasing grammar expressiveness and for constructing practical language translation tools. |
| www.hostingciamca.com /index.php?title=Formal_grammar (1448 words) |
|