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:
“A regular council was held with the Indians, who had come in on their ponies, and speeches were made on both sides through an interpreter, quite in the described mode,—the Indians, as usual, having the advantage in point of truth and earnestness, and therefore of eloquence. The most prominent chief was named Little Crow. They were quite dissatisfied with the white man’s treatment of them, and probably have reason to be so.”
—Henry David Thoreau (1817–1862)
“Books, gentlemen, are a species of men, and introduced to them you circulate in the “very best society” that this world can furnish, without the intolerable infliction of “dressing” to go into it. In your shabbiest coat and cosiest slippers you may socially chat even with the fastidious Earl of Chesterfield, and lounging under a tree enjoy the divinest intimacy with my late lord of Verulam.”
—Herman Melville (1819–1891)
“Hence, a generative grammar must be a system of rules that can iterate to generate an indefinitely large number of structures. This system of rules can be analyzed into the three major components of a generative grammar: the syntactic, phonological, and semantic components.”
—Noam Chomsky (b. 1928)