Generalised parsing with binary subtree representations

Thomas van Binsbergen

Graph-structures such as shared packed parse forests (SPPFs) and annotated terms (ATerms) typically form the output of a generalised parser. This talk introduces sets of binary subtree representations (BSR sets) as an alternative and shows how BSR sets can be generated by a generalised parser. The set-based output removes the clerical overhead associated with graph construction, simplifying the definition of the parser. This talk further demonstrates how the potentially many derivations embedded in a BSR set can be extracted, interpreted, or discarded in a post-processing phase.

---

Previous: | Sebastian Erdweg to Mainz
Next: | Oracle funds Flexible, Composable, and Incremental Compiler Pipelines