Indexed Grammars, ET0L Systems and Programming Languages: A Tribute to Alexandru Mateescu

Nicolescu, R; Vaida, D

dc.contributor.author	Nicolescu, R	en
dc.contributor.author	Vaida, D	en
dc.date.accessioned	2015-01-05T00:14:04Z	en
dc.date.available	2015-01-05T00:14:04Z	en
dc.date.issued	2014	en
dc.identifier.citation	CDMTCS Research Reports CDMTCS-464 (2014)	en
dc.identifier.issn	1178-3540	en
dc.identifier.uri	http://hdl.handle.net/2292/23896	en
dc.description.abstract	We revise and extend a couple of earlier incompletely published papers regarding the competence limits of formal systems in modelling the full syntax of programing languages. We show that the full syntax of mainstream programming languages (e.g. similar to Pascal or CAML) and of schema based XML documents cannot be modelled by either ET0L systems or indexed grammars. We raise a few open questions related to ET0L languages and two powerful but less known classes of languages: iterative languages and generalised Ogden-like languages.	en
dc.publisher	Department of Computer Science, The University of Auckland, New Zealand	en
dc.relation.ispartofseries	CDMTCS Research Report Series	en
dc.rights	Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher.	en
dc.rights.uri	https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm	en
dc.source.uri	https://www.cs.auckland.ac.nz/research/groups/CDMTCS/researchreports/index.php	en
dc.title	Indexed Grammars, ET0L Systems and Programming Languages: A Tribute to Alexandru Mateescu	en
dc.type	Technical Report	en
dc.subject.marsden	Fields of Research	en
dc.rights.holder	The author(s)	en
dc.rights.accessrights	http://purl.org/eprint/accessRights/OpenAccess	en