We develop a set of new tabular parsing algorithms for Linear Indexed Grammars, including bottom-up algorithms and Earley-like algorithms with and without the valid prefix property, creating a continuum in which one algorithm can in turn be derived from another. The output of these algorithms is a shared forest in the form of a context-free grammar that encodes all possible derivations for a given input string.
Use this form to create a GitHub issue describing the correction. You will need a GitHub account.
A staff member will review the issue; see how author pages work.
⚠️ Mobile Users: Submitting this form to create a new issue will only work with github.com, not the GitHub Mobile app.
What would you like to do?
Verify author
Submitted a paper through OpenReview in 2025 or later?
You probably don't need this form: add your ORCID link to your OpenReview profile,
and your page will be verified automatically within a few weeks.