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)
“When the tree falls, the monkeys scatter.”
—Chinese proverb.
“I demand that my books be judged with utmost severity, by knowledgeable people who know the rules of grammar and of logic, and who will seek beneath the footsteps of my commas the lice of my thought in the head of my style.”
—Louis Aragon (1897–1982)