In computer science, a regular tree grammar (RTG) is a formal grammar that describes a set of directed trees.
Read more about Regular Tree Grammar: Definition, Derivation of Trees, Examples, Language Properties, Alternative Characterizations and Relation To Other Formal Languages, See Also
Famous quotes containing the words regular, tree and/or grammar:
““I couldn’t afford to learn it,” said the Mock Turtle with a sigh. “I only took the regular course.”
“What was that?” inquired Alice.
“Reeling and Writhing, of course, to begin with,” the Mock Turtle replied; “and then the different branches of Arithmetic—Ambition, Distraction, Uglification, and Derision.”
“I never heard of ‘Uglification,’” Alice ventured to say.”
—Lewis Carroll [Charles Lutwidge Dodgson] (1832–1898)
“Is not disease the rule of existence? There is not a lily pad floating on the river but has been riddled by insects. Almost every shrub and tree has its gall, oftentimes esteemed its chief ornament and hardly to be distinguished from the fruit. If misery loves company, misery has company enough. Now, at midsummer, find me a perfect leaf or fruit.”
—Henry David Thoreau (1817–1862)
“The new grammar of race is constructed in a way that George Orwell would have appreciated, because its rules make some ideas impossible to express—unless, of course, one wants to be called a racist.”
—Stephen Carter (b. 1954)