
	Where results make sense

Topic: Attribute grammar

Related Topics

context free grammars

formal grammars

Royal Grammar School Worcester

German grammar

transformational grammar

universal grammar

object grammar

Slough Grammar School

Parsing expression grammar

Film grammar

English grammar

In the News (Wed 16 Dec 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	Cover Pages: XML and Attribute Grammars
		Attribute grammars provide a mechanism for annotating the nodes of a tree with so-called 'attributes', by means of so-called 'semantic rules' which can work either bottom-up (for so-called 'synthesized' attribute values) or top-down (for so-called 'inherited' attribute values).
		Attribute grammars, on the other hand, are a declarative formalism, whose evaluation visits each node of the input tree only a constant number of times (once for each attribute).
		Attribute grammars provide a mechanism for annotating the nodes of a tree with so-called 'attributes', by means of so-called 'semantic rules' which can work either bottom-up (for so- called 'synthesized' attribute values) or top-down (for so- called 'inherited' attribute values).
	xml.coverpages.org /xmlAttributeGrammars.html (4034 words)

	[No title]
		Lecture Notes Alex Aiken CS 264, Spring 95 Topic: Attribute Grammars and Incremental Semantic Analysis ----------------------------------------------------------- I Semantic Actions So far, we have indicated that the job of parsing is to build a parse tree.
		Evaluating Attributes - S attributed definitions are a very special case of attribute grammars - The most general method is to construct an ordering from the parse tree itself: Define a graph as follows.
		A path that goes from some attribute of alpha to attributes outside the subtree and back - In particular any path originating outside the subtree of A and crossing into the subtree of A must pass through an attribute of A. - This is a key fact exploited by many attribute grammar algorithms.
	www.cs.berkeley.edu /~aiken/cs264/lectures/attribute-grammars (2025 words)

	UU_AG
		If a child has an inherited attribute with the same name as its father, and no semantic function has been specified, a so-called copy rule is generated by the system that corresponds to the identity function applied to the inherited attribute of the father.
		If a father node has a synthesised attribute for which no rule is given, and there is a child which also has a synthesised attribute with the same name a copy rule is generated (this is an instance of a more general rule for generating copy rules that will be explained later).
		If there exists a local attribute, or an elememnt in the pattern of a local attribute that has the same name as the attribute for which the definition is missing, a rule is geneated through which that elemnet is referred.
	www.cs.uu.nl /groups/ST/Software/UU_AG/index.html (1563 words)

	A definite-clause grammar representation of an XSD schema
		A definite-clause grammar representation of an XSD schema
		Another obvious improvement would be to check to ensure that attributes are not specified more than once (strictly speaking, the upstream XML processor should be checking this, so this is probably not essential)[6] and that required attributes do have values specified.
		Attributes are checked to see that they were declared and that their value is of the correct type.
	www.w3.org /People/cmsmcq/2004/podcg.html (3897 words)

	<grammar>
		When the speech-recognition engine detects a match with a grammar, it may cause a transition to another dialog (if the grammar is in a menu item or link) or assign a return value to assign to an input variable (if the grammar is in a form or input item).
		For an inline XML grammar, the attribute occurs in the VoiceXML document.
		If the built-in grammar is used as a field grammar, then the slot names and values returned are converted into properties and values on the field's input variable.
	cafe.bevocal.com /docs/vxml/grammar.html (2850 words)

	4 XML Speech Grammar Format
		If the grammar is an internal grammar, then it inherits its prolog from the prolog for the VoiceXML document as a whole; that is, an inline XML grammar cannot have a separate XML prolog.
		The mode of a grammar indicates whether the grammar is for recognizing speech or DTMF input.
		For an external grammar, however, specifying the root rule for the grammar in the definition is optional.
	cafe.bevocal.com /docs/grammar/xml.html (4979 words)

	A logic grammar representation for XML Schema
		The term logic grammar is used to denote grammars written in logic-programming systems; this paper works with definite-clause translation grammars (DCTGs), which employ a formalism which closely resembles attribute grammars as described by [Knuth 1968] and later writers.
		The values of the properties of an attribute declaration must be as described in the property tableau in The Attribute Declaration Schema Component, modulo the impact of Missing Sub-components.
		The values of the properties of an attribute use must be as described in the property tableau in The Attribute Use Schema Component, modulo the impact of Missing Sub-components.
	www.w3.org /People/cmsmcq/2003/lgrxs.html (7656 words)

	[No title]
		X.a is how attributes are written, a is an attribute (value) of the grammar symbol X. Table 6.1 gives an attribute grammar for simple numbers, where the attribute being represented is the value of the number.
		Note that + in the grammar is playing a dual role, one of grammar symbol and one of addition of values.
		The difference is that 6.6 is referring to the parse tree or a derivation sequence associated with the grammar whereas 6.7 is referring to the grammar rules.
	www.unf.edu /public/cop4620/ree/Notes/ch6.txt (881 words)

	Syntax (Site not responding. Last check: 2007-10-13)
		Grammars are independent of computational models and are useful for the description of the structure of languages in general.
		Context-free grammars are used to describe the bulk of the language's structure; regular expressions are used to describe the lexical units (tokens); attribute grammars are used to describe the context sensitive portions of the language.
		In a derivation tree for an abstract grammar, the internal nodes are labeled with the operator and the the operands are their children and there are no concrete symbols in the tree.
	cs.wwc.edu /~aabyan/PLBook/HTML/Syntax.html (4867 words)

	ST / Attribute Grammar System
		The Attribute Grammar system was initially developed by DoaitseSwierstra in 1999.
		The Attribute Grammar system reads a set of files containing an attribute grammar, in which semantic functions are described through Haskell expressions.
		To compile the Attribute Grammar system a Haskell compiler or interpreter, such as Hugs or GHC, that supports universal quantification of type variables(Hugs: -98 flag; GHC -fglasgow-exts flag) is required.
	www.cs.uu.nl /wiki/Center/AttributeGrammarSystem (589 words)

	Attribute grammar - Wikipedia, the free encyclopedia
		The synthesized attributes are the result of the attribute evaluation rules, and may also use the values of the inherited attributes.
		Attribute grammars can also be used to translate the syntax tree directly into code for some specific machine, or into some intermediate language.
		Semantics of context-free grammars, by Don Knuth, is the original paper introducing attributed grammars.
	en.wikipedia.org /wiki/Attribute_grammar (287 words)

	Formal grammar - Wikipedia, the free encyclopedia
		The two main categories of formal grammar are that of generative grammars, which are sets of rules for how strings in a language can be generated, and that of analytic grammars, which are sets of rules for how a string can be analyzed to determine whether it is a member of the language.
		In regular grammars, the left hand side is again only a single nonterminal symbol, but now the right-hand side is also restricted: It may be nothing, or a single terminal symbol, or a single terminal symbol followed by a nonterminal symbol, but nothing else.
		Although, in practice, regular grammars are commonly expressed using regular expressions, some forms of regular expression used in practice do not strictly generate the regular languages and do not show linear recognitional performance due to those deviations.
	en.wikipedia.org /wiki/Formal_grammar (1628 words)

	RAGS - Survey of Grammar Models
		The attribute system associates with each CFG rule a group of formulae called semantic rules, which specify the dependencies between the attributes of a parent node and the attributes of its children when the parent's nonterminal is expanded via that CFG rule.
		One large family of grammar models increase the power of CFGs by placing restrictions on the order in which the context-free rules can be applied during derivation; a drawback of this approach is that the context-dependent factors are invisible in the parse tree.
		Indexed grammars are another less commonly used model, in which the application of otherwise context-free rules can be regulated by means of index lists, which are attached to the nonterminals much like inherited attributes in an extended attribute grammar.
	web.cs.wpi.edu /~jshutt/thesis/survey.html (1720 words)

	CSC 530 Lecture Notes Week 4
		attribute at the root of the tree is a global attribute, whose value is accessible to all nodes.
		In an attribute grammar with only synthesized attributes, the evaluation can always be accomplished by a single bottom-up traversal of the tree, since synthesized attributes are always passed up in the tree during evaluation.
		When inherited attributes are added to a definition, the traversal order must be chosen such that when a particular attribute a is to be evaluated, the values of all other attributes on which a depends are known.
	www.csc.calpoly.edu /~gfisher/classes/530/lectures/4.html (1753 words)

	Chapter 5 (Site not responding. Last check: 2007-10-13)
		Attribute evaluation functions assert that some attribute is some function of other attributes.
		For a given attribute grammar, the set of attributes associated with a particular nonterminal is the union its the sets of inherited and synthesized attributes.
		Attribute evaluation functions cannot be collected together into empty productions in an attribute grammar.
	www.cs.ndsu.nodak.edu /~kvanhorn/cs722/chap5.html (1828 words)

	Attribute Grammars (Site not responding. Last check: 2007-10-13)
		An attribute grammar is a formal structure for recognizing the context sensitive part of a programming language.
		An attribute grammar uses the context free grammar of a program as the framework on which to build the grammar.
		Here are the two figures we used in class for attribute grammars, a node from an attribute grammar and a parse tree fragmant for the statement
	www.mcs.drexel.edu /~rweaver/COURSES/MCS360/TOPICS/ag.html (210 words)

	voicexml elements - grammar
		Grammars may be defined inline (within the vxml document itself), or as a standalone, external file.
		The ‘fetchtimeout’ attribute is used to indicate how long, (in seconds or milliseconds), the interpreter should attempt to fetch the content before throwing an error.badfetch exception.
		If a value for this attribute is not specified, then the grammar inherits the scope of its parent element.
	www.vxml.org /grammar.htm (1023 words)

	[No title] (Site not responding. Last check: 2007-10-13)
		AGdefs.i3: The interface which defines the attributes for each non-terminal You are required to fill in this interface AGrules.i3: The interface which defines the computation rules for the attribute grammar.
		So rather than having a single "eval" function for evaluating the attribute grammar, the "eval" function is distributed among the various nonterminal object types which make up the attribute grammar.
		A benefit of this approach is that the parser is independent of the particular attribute grammar; it only sees a stack of AG.NONTERMINAL objects (all of which have an "eval" method for evaluating their attributes).
	plg.uwaterloo.ca /~gvcormac/ag/fall94/a3.txt (672 words)

	CSC355 Note - Set 9
		value of attribute at a node is defined in terms of the attributes at the children of that node
		value of attribute at a node is defined in terms of the attributes at the parent and/or siblings of that node
		Attribute in is inherited and passed down the treee
	courses.dsu.edu /csc355/notes/notset09.htm (696 words)

	Comonadic Functional Attribute Evaluation \| Lambda the Ultimate
		Here we argue that attribute evaluation has a lot in common with dataflow computation and admits a similar analysis.
		We claim that this yields a new, modular way to organize both attribute evaluation programs written directly in a functional language as well as attribute grammar processors.
		For attribute grammars, this approach seems elegant enough from a casual read, but they don't offer a detailed comparison with prior work on attribute grammars, and I'm nowhere near familiar enough to judge for myself.
	lambda-the-ultimate.org /node/1666 (640 words)

	Opera Directory (Site not responding. Last check: 2007-10-13)
		The formalism for the to attribute grammars related Affix Grammar over Finite Lattices developed at the University of Nijmegen is being applied to natural-language processing.
		Context-free grammars can be described on a primary context-free level augmented by secondary-level features for expressing agreement between parts of speech.
		The system generates efficient incremental attribute evaluators and was written by one of the attribute-grammar formalizers.
	portal.opera.com /web/?cat=6423 (211 words)

	[No title]
		In this directory are various programs that make up a Modular Attribute Grammar generator and evaluator as described in "Modular Attribute Grammars", by Gery Dueck and Gordon Cormack, to appear in Computer Journal (hopefully April 90).
		Prepare a context-free grammar suitable for input to "slr".
		Each terminal symbol is automatically given the attributes "text", "line", and "col, specifying the lexeme's text and position in the source file.
	plg.uwaterloo.ca /~ftp/mag/README (302 words)

	A Practical Attribute Grammar Circularity Test (Site not responding. Last check: 2007-10-13)
		Efficient implementations for two optimisations to Knuth's attribute grammar circularity test are described.
		Parallel attribute evaluation - structure of evaluators and detection of parallelism.
		In: Deransart P, Jourdan M (eds.), Attribute Grammars and their Applications (Lecture Notes in Computer Science 461), pp 61-75 (1990).
	www.mattababy.org /~belmonte/Publications/Papers/88_TR (85 words)

	Mapping the Concrete Grammar
		With real compilers we almost always put productions in the concrete grammar that are necessary to insure that the programs parse correctly but that are unnecessary in the attribute grammar.
		Eli gives us a way to "map" the concrete grammar we use for parsing to a smaller abstract grammar that will form the skeleton for the attribute grammar.
		You can use Symbol Mapping with our grammar to clean up some other things, but the expression part is most of it and is the only part you have to do for your homework.
	www.mcs.drexel.edu /~rweaver/COURSES/MCS761/TOPICS/map.html (528 words)

	[No title]
		In general, anything that requires the requires the compiler to compare things that are separate by a long distance or to count things ends up being a matter of semantics.
		The action rules for L-attributed grammars, in which the attribute flow is depth-first left-to-right, can be evaluated in the order of the parse tree prediction for LL grammars.
		Action rules for S-attributed grammars can be incorporated at the end of the right-hand sides of LR grammars.
	www.cs.unca.edu /~bruce/Fall03/csci431/slides/ch4.ppt (864 words)

	RELAX NG Tutorial
		attribute is specified on the root element of the RELAX NG pattern.
		Thus, it considers an element or attribute to have both a local name and a namespace URI which together constitute the name of that element or attribute.
		attribute to identify the namespace of the datatype
	www.oasis-open.org /committees/relax-ng/tutorial.html (4294 words)

	Attribute Grammar Example: Declaration Semantics
		This informal description of the semantics is sufficient explanation for a programmer to be able to write sensible declarations, but for purposes of automating type-checking (such as a compiler would do), a more formal, computational description of the semantics is desirable.
		In these notes, we show how this semantics can be specified via an attribute grammar.
		We now extend the above BNF grammar to an attribute grammar by introducing a type attribute for the symbols and giving a set of semantic rules for calculating the values of the attributes.
	www.emunix.emich.edu /~remmers/337/decl_semantics.html (258 words)

	Catalog of compilers: The FNC-2 Attribute Grammar System (Site not responding. Last check: 2007-10-13)
		FNC-2: the Olga compiler and attribute evaluator generator; ATC: a generator of abstract tree constructors driven by bottom-up parsers, with two flavours, one on top of SYNTAX, and one on top of Lex and Yacc;
		PPAT: a generator of unparsers of attributed abstract trees, based on the TeX-like notion of nested boxes of text.
		Versatility: The generated evaluators can be interfaced with many other tools and produced in many variations: Several modes of attribute evaluation: exhaustive; incremental; concurrent (on shared-memory multiprocessor machines).
	www.idiom.com /free-compilers/TOOL/Attribut-1.html (306 words)

	Comp.compilers: Attribute Grammar Technology (Site not responding. Last check: 2007-10-13)
		Attribute Grammar Technology crocus.waterloo.edu!rmpinchback@RELAY.CS.NET (Reid M. Pinchback) (1988-08-09)
		I've heard the buzz-phrase "attribute grammar" before, but I've never
		grammar, how does it differ structurally from other kinds of grammars,
	compilers.iecc.com /comparch/article/88-08-012 (73 words)

Try your search on: Qwika (all wikis)