Automatic derivation of compact abstract syntax data types from concrete syntax descriptions
| dc.contributor.author | Lorenzen, Florian | |
| dc.date.accessioned | 2020-06-15T06:31:19Z | |
| dc.date.available | 2020-06-15T06:31:19Z | |
| dc.date.issued | 2011 | |
| dc.description.abstract | We describe an algorithm (written in Haskell) to automatically derive compact abstract syntax data types from concrete grammar descriptions. The input for the algorithm is almost the grammar language of the parser generator PaGe which not only constructs a parser but also the data types necessary to represent an abstract syntax tree. The algorithm of this report is suitable to minimize the data type used to represent the parsing result to both improve the handling of abstract syntax trees and their space requirements. | en |
| dc.identifier.issn | 1436-9915 | |
| dc.identifier.uri | https://depositonce.tu-berlin.de/handle/11303/11346 | |
| dc.identifier.uri | http://dx.doi.org/10.14279/depositonce-10233 | |
| dc.language.iso | en | |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | |
| dc.subject.ddc | 004 Datenverarbeitung; Informatik | |
| dc.subject.other | grammar language | en |
| dc.subject.other | Haskell | en |
| dc.subject.other | correctness | en |
| dc.title | Automatic derivation of compact abstract syntax data types from concrete syntax descriptions | en |
| dc.type | Research Paper | |
| dc.type.version | submittedVersion | en |
| tub.accessrights.dnb | free | |
| tub.affiliation | Fak. 4 Elektrotechnik und Informatik | de |
| tub.affiliation.faculty | Fak. 4 Elektrotechnik und Informatik | de |
| tub.publisher.universityorinstitution | Technische Universität Berlin | |
| tub.series.issuenumber | 2011-11 | |
| tub.series.name | Forschungsberichte der Fakultät IV - Elektrotechnik und Informatik / Technische Universität Berlin |
Files
Original bundle
1 - 1 of 1