Content deleted Content added
ClueBot NG (talk | contribs) m Reverting possible vandalism by 122.168.235.21 to version by 130.133.50.96. Questions, comments, complaints -> BRFA Thanks, ClueBot NG. (17448) (Bot) |
|||
| (10 intermediate revisions by 8 users not shown) | |||
Line 1:
[[File:Fancy noun recursive transition network.svg|350px|thumb|A recursive transition network for "fancy nouns". Note that recursion is created by the nodes labelled "Fancy noun".]]
A '''recursive transition network''' ("RTN") is a [[graph theory|graph theoretical]] [[schematic]] used to represent the rules of a [[context free grammar]]. RTNs have application to [[programming language]]s, [[natural language]] and [[lexical analysis]]. Any [[Sentence (linguistics)|sentence]] that is constructed according to the rules of an RTN <ref>A sentence is generated by a RTN by applying the generative rules specified in the RTN itself. These represent any set of rules or a function consisting of a finite number of steps.</ref> is said to be "well-formed." The structural elements of a well-formed sentence may also be well-formed sentences by themselves, or they may be simpler structures. This is why RTNs are described as [[recursive]].▼
▲A '''recursive transition network''' ("RTN") is a [[graph theory|graph theoretical]] [[schematic]] used to represent the rules of a [[context
== Notes and references ==
Line 5 ⟶ 7:
==See also==
* [[Syntax diagram]]
* [[Computational linguistics]]
* [[Context free language]]
* [[Finite
* [[Formal grammar]]
* [[Parse tree]]
Line 19 ⟶ 21:
{{
| |||