COMPLEXITY CHARACTERIZATIONS OF ATTRIBUTE GRAMMAR LANGUAGES.

Ephremidis, Sophocles; Papadimitriou Christos, H; Sideris, Martha

dc.contributor.author	Ephremidis, Sophocles	en
dc.contributor.author	Papadimitriou Christos, H	en
dc.contributor.author	Sideris, Martha	en
dc.date.accessioned	2014-03-01T02:47:48Z
dc.date.available	2014-03-01T02:47:48Z
dc.date.issued	1987	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33352
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-0023249223&partnerID=40&md5=1be8a73c0ce4ef5a37fac60bb1a01105	en
dc.subject.other	COMPUTER PROGRAMMING LANGUAGES	en
dc.subject.other	MATHEMATICAL TECHNIQUES - Polynomials	en
dc.subject.other	ATTRIBUTE GRAMMAR LANGUAGES	en
dc.subject.other	COMPLEXITY CHARACTERIZATIONS	en
dc.subject.other	EXPONENTIAL TIME	en
dc.subject.other	PARSE TREE	en
dc.subject.other	AUTOMATA THEORY	en
dc.title	COMPLEXITY CHARACTERIZATIONS OF ATTRIBUTE GRAMMAR LANGUAGES.	en
heal.type	conferenceItem	en
heal.publicationDate	1987	en
heal.abstract	An attribute grammar AG generates the language consisting of all strings that have a legal parse tree in AG. Because of the predicates, a parse tree of the original context-free grammar may no longer be a legal parse tree of the attribute grammar, and thus the language generated by an attribute grammar is in general a subset of the corresponding context-free language. It is clear that any context-free language can be generated by an attribute grammar with trivial attributes, functions, and predicates, but the converse is not valid. It is easy to construct simple attribute grammars that accept languages that are not context-free. Two questions are investigated: what exactly is the expressive power of attribute grammar; and which superset of the context-free languages do they exactly define?	en
heal.publisher	IEEE, New York, NY, USA	en
heal.journalName	[No source information available]	en
dc.identifier.spage	10	en
dc.identifier.epage	13	en