You are in : Home » Results & submissions » Select UOA » 11 - Computer Science and Informatics » View submission: Royal Holloway, University of London » Outputs » Detail

Output details

11 - Computer Science and Informatics

Royal Holloway, University of London

Return to search Previous output Next output

Output 46 of 90 in the submission

Article title

GLL parse-tree generation

Type

D - Journal article

DOI

10.1016/j.scico.2012.03.005

Title of journal

Science of Computer Programming

Article number

Volume number

Issue number

First page of article

1828

ISSN of journal

0167-6423

Year of publication

2013

URL

http://www.sciencedirect.com/science/article/pii/S0167642312000627

Number of additional authors

Additional information

<08>This paper provides the formal reference definition of our GLL algorithm, and specifies the mechanisms for derivation forest construction. The algorithm is fast and general, returning the (potentially infinite) set of derivations in worst case cubic time, but achieving linear performance on LL(1) parts of the grammar. GLL is thus becoming the algorithm of choice for developers of generalised parser generators. Rascal, the successor to the well known ASF+SDF from CWI Amsterdam, uses GLL, and Technical University Eindhoven are developing a framework for metamodelling based on GLL. Our own implementation underpins Royal Holloway's contribution to the PLanCompS project (EPSRC EP/I032657/1).

Interdisciplinary

Cross-referral requested

Research group

C - Centre for Software Language Engineering

Citation count

Proposed double-weighted

Double-weighted statement

Reserve for a double-weighted output

Non-English

English abstract