GLL syntax analysers for EBNF grammars
- Submitting institution
-
Royal Holloway and Bedford New College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 29105898
- Type
- D - Journal article
- DOI
-
10.1016/j.scico.2018.06.001
- Title of journal
- Science of Computer Programming
- Article number
- -
- First page
- 120
- Volume
- 166
- Issue
- -
- ISSN
- 0167-6423
- Open access status
- Compliant
- Month of publication
- June
- Year of publication
- 2018
- 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
- 0
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper introduces EBNF GLL, which admits grammars whose rules have regular expressions as right hand sides and which is essential for direct implementation of EBNF Java/C++ specifications. GLL is the algorithm of choice for generalised parsers developers. SonarSource, a Geneva based international company that builds products for security, have used GLL to solve a difficult ambiguity problem with their C++ plugin. Rascal, CWI Amsterdam's replacement for their ASF+SDF tool, and an updated version of the University of Illinois' K-framework use GLL style parsers.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -