Derivation representation using binary subtree sets. / Scott, Elizabeth; Johnstone, Adrian; van Binsbergen, L. Thomas.
In: Science of Computer Programming, Vol. 175, 15.04.2019, p. 63-84.Research output: Contribution to journal › Article › peer-review
Derivation representation using binary subtree sets. / Scott, Elizabeth; Johnstone, Adrian; van Binsbergen, L. Thomas.
In: Science of Computer Programming, Vol. 175, 15.04.2019, p. 63-84.Research output: Contribution to journal › Article › peer-review
}
TY - JOUR
T1 - Derivation representation using binary subtree sets
AU - Scott, Elizabeth
AU - Johnstone, Adrian
AU - van Binsbergen, L. Thomas
PY - 2019/4/15
Y1 - 2019/4/15
N2 - This paper introduces sets of binary subtree representations as an alternative to shared packed parse forests as the output of a generalised parser, and shows how these may be generated by Earley's algorithm,by a new GLL-style parser and by Johnson's continuation passing combinator style parsers. The set based output removes the clerical overhead associated withgraph constructions, making the parsers simpler.
AB - This paper introduces sets of binary subtree representations as an alternative to shared packed parse forests as the output of a generalised parser, and shows how these may be generated by Earley's algorithm,by a new GLL-style parser and by Johnson's continuation passing combinator style parsers. The set based output removes the clerical overhead associated withgraph constructions, making the parsers simpler.
U2 - 10.1016/j.scico.2019.01.008
DO - 10.1016/j.scico.2019.01.008
M3 - Article
VL - 175
SP - 63
EP - 84
JO - Science of Computer Programming
JF - Science of Computer Programming
SN - 0167-6423
ER -