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.

Sign up for GitHub

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

Jump to bottom

Abstract LR parsing for grammar-compressed graph processing #287

Open
4 tasks
gsvgit opened this issue Oct 26, 2017 · 0 comments
Open
4 tasks

Abstract LR parsing for grammar-compressed graph processing #287

gsvgit opened this issue Oct 26, 2017 · 0 comments
Labels
task

Comments

@gsvgit
Copy link
Member

gsvgit commented Oct 26, 2017 •
edited

Should be investigated, reworked, rethought.

  • Investigate Abstract LR parsing:
  • Investigate grammar compression of graphs. You can start from Grammar-Based Graph Compression
  • For arbitrary CF grammars abstract LR parsing produce approximated solution. Can it be used for finding exact solution in case when one of CF grammars describes regular language?
  • Try to use Abstract LR parsing for Context-Free path querying in grammar compressed graphs.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
task
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@gsvgit