Derivation representation using binary subtree sets
- Submitting institution
-
Royal Holloway and Bedford New College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 33419469
- Type
- D - Journal article
- DOI
-
10.1016/j.scico.2019.01.008
- Title of journal
- Science of Computer Programming
- Article number
- -
- First page
- 63
- Volume
- 175
- Issue
- -
- ISSN
- 0167-6423
- Open access status
- Compliant
- Month of publication
- January
- Year of publication
- 2019
- 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
-
2
- Research group(s)
-
-
- Citation count
- 1
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper introduces BSR sets as a smaller and easier to construct representation of all of the derivations of a sentence from a context free grammar. The difficulty of building the standard graphical representation is illustrated in 'GLL syntax analysers for EBNF grammars'. This paper takes that work in a new direction. The approach can be applied to all parsing techniques, in particular it allows a simple correction to the error in Earley's seminal 1970 paper on generalised parsing.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -