Recursive transition network
A recursive transition network ("RTN") is a graph theoretical schematic used to represent the rules of a context-free grammar. RTNs have application to programming languages, natural language and lexical analysis. Any sentence that is constructed according to the rules of an RTN[1] 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 for "fancy nouns". Note that recursion is created by the nodes labelled "Fancy noun".
Notes and references
- 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.
gollark: I read somewhere that the environment list thing was near argv in memory, so it finds a common environment variable's location using `getenv`, scans backward until it finds `python3`, then randomly overwrites things.
gollark: Do you like my `argv[0]`-setting code, by the way? I think that's what it has to use to deceive `ps ax`.
gollark: It's not like you can check, except by checking.
gollark: My thing provides different names for each.
gollark: They do in `ps ax` but not `ps -A` or `top`.
See also
- Syntax diagram
- Computational linguistics
- Context free language
- Finite state machine
- Formal grammar
- Parse tree
- Parsing
- Augmented transition network
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.