dc.contributor.author |
Sideri, M |
en |
dc.contributor.author |
Efremidis, S |
en |
dc.contributor.author |
Papakonstantinou, G |
en |
dc.date.accessioned |
2014-03-01T01:07:39Z |
|
dc.date.available |
2014-03-01T01:07:39Z |
|
dc.date.issued |
1989 |
en |
dc.identifier.issn |
0010-4620 |
en |
dc.identifier.uri |
https://dspace.lib.ntua.gr/xmlui/handle/123456789/10096 |
|
dc.relation.uri |
http://www.scopus.com/inward/record.url?eid=2-s2.0-0024611178&partnerID=40&md5=8f7d6a042fdb1de16a7c36a6b1570785 |
en |
dc.subject.classification |
Computer Science, Hardware & Architecture |
en |
dc.subject.classification |
Computer Science, Information Systems |
en |
dc.subject.classification |
Computer Science, Software Engineering |
en |
dc.subject.other |
Computer Programming--Algorithms |
en |
dc.subject.other |
Attribute Grammars |
en |
dc.subject.other |
Semantically Driven Parsing |
en |
dc.subject.other |
Automata Theory |
en |
dc.title |
Semantically driven parsing of context-free languages |
en |
heal.type |
journalArticle |
en |
heal.language |
English |
en |
heal.publicationDate |
1989 |
en |
heal.abstract |
An algorithm is presented for the parsing of languages generated by attribute grammars in which no restrictions are imposed on the dependencies of the attributes used in parsing decisions. |
en |
heal.publisher |
CAMBRIDGE UNIV PRESS |
en |
heal.journalName |
Computer Journal |
en |
dc.identifier.isi |
ISI:A1989T378500015 |
en |
dc.identifier.volume |
32 |
en |
dc.identifier.issue |
1 |
en |
dc.identifier.spage |
91 |
en |
dc.identifier.epage |
93 |
en |