Structuring the GLL parsing algorithm for performance
- Submitting institution
-
Royal Holloway and Bedford New College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 28967248
- Type
- D - Journal article
- DOI
-
10.1016/j.scico.2016.04.003
- Title of journal
- Science of Computer Programming
- Article number
- -
- First page
- 1
- Volume
- 125
- Issue
- -
- ISSN
- 0167-6423
- Open access status
- Access exception
- Month of publication
- April
- Year of publication
- 2016
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
1
- Research group(s)
-
-
- Citation count
- 7
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- GLL parsing has become the general context free parsing algorithm of choice, as noted by the keynote speaker at the 2019 Software Language Engineering Conference. This paper describes techniques that underpin pragmatic, efficient implementations of general parsers in real applications. Example application libraries written by third parties include https://github.com/rust-lang/gll and https://github.com/djspiewak/gll-combinators/blob/master/README.rst where it is noted that on typical grammars the implementation is actually faster than traditional combinators, as well as being general.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -