Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Semantic calculation for graph parsing #5

Open
3 tasks
gsvgit opened this issue Sep 22, 2017 · 0 comments
Open
3 tasks

Semantic calculation for graph parsing #5

gsvgit opened this issue Sep 22, 2017 · 0 comments
Labels

Comments

@gsvgit
Copy link
Member

gsvgit commented Sep 22, 2017

Meerkat supports semantic code specification, but it works only if the result of parsing is an SPPF with a single tree. SPPF is a compressed representation of parse forest. In case of graph parsing, we get an arbitrary SPPF which can contains an infinite set of trees. One of the possible solutions is lazy tree extraction. For each tree semantic code can be calculated by using existing methods. The result is a lazy collection of semantic values for each tree from SPPF.

  • Implement BFS-based lazy trees extraction.
  • Implement the interface for a user, which provides an ability to calculate semantic code for arbitrary parsing result.
  • Implement tests.
@gsvgit gsvgit added the CSC label Sep 22, 2017
@gsvgit gsvgit mentioned this issue Aug 20, 2019
5 tasks
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Projects
None yet
Development

No branches or pull requests

1 participant