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:
“They were regular in being gay, they learned little things that are things in being gay, they learned many little things that are things in being gay, they were gay every day, they were regular, they were gay, they were gay the same length of time every day, they were gay, they were quite regularly gay.”
—Gertrude Stein (1874–1946)
“If you believe in the soul, do not clutch at sensual sweetness before it is ripe on the slow tree of cause and effect.”
—Ralph Waldo Emerson (1803–1882)
“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)