poster

Parsing Strategies for Context-Sensitive Graph Grammars

Authors:

Yang Zou,

Xiaoqin Zeng,

Yufeng LiuAuthors Info & Claims

VINCI '19: Proceedings of the 12th International Symposium on Visual Information Communication and Interaction

Article No.: 27, Pages 1 - 2

https://doi.org/10.1145/3356422.3356443

Published: 20 September 2019 Publication History

Get Access

Abstract

Context-sensitive graph grammars have been suitable formalisms for specifying visual programming languages, as they are intuitive, sufficient expressive and equipped with parsing mechanisms. Parsing has been a fundamental issue in the research of context-sensitive graph grammars. However, the existent parsing algorithms are either inefficient or confined to a minority of graph grammars. This paper presents two strategies for general parsing algorithms, one is context matching, and the other is partitioning of productions. Through narrowing down the searching space of potential redexex, the two strategies can considerably improve the parsing performance.

References

[1]

J. Rekers and A. Schürr (1997). Defining and Parsing Visual Languages with Layered Graph Grammars. Journal of Visual Languages and Computing, 8(1), 27--55.

Crossref

Google Scholar

[2]

D. Zhang, K. Zhang, and J. Cao (2001). A Context-sensitive Graph Grammar Formalism for the Specification of Visual Languages. The Computer Journal, 44(3), 187--200.

Crossref

Google Scholar

[3]

Y. Zou, J. Lü, and X. Tao (2019). Research on context of implicit context-sensitive graph grammars. Journal of Computer Languages, 51, 241--260. https://doi.org/10.1016/j.cola.2019.01.002

Crossref

Google Scholar

[4]

Y. Zou, X. Zeng, Y. Liu, and H. Liu (2019). Approach to Context Computation for Context-sensitive Graph Grammars. International DMS Conference on Visualization and Visual Languages, 21--29.

Crossref

Google Scholar

[5]

Y. Zou, X. Zeng, Y. Liu, and H. Liu (2017). Partial Precedence of Context-sensitive Graph Grammars. International Symposium on Visual Information Communication and Interaction, 16--23.

Google Scholar

Parsing Strategies for Context-Sensitive Graph Grammars
1. Theory of computation
  1. Formal languages and automata theory
    1. Formalisms

Recommendations

Partial precedence of context-sensitive graph grammars
VINCI '17: Proceedings of the 10th International Symposium on Visual Information Communication and Interaction

Context-sensitive graph grammars have been rigorous formalisms for specifying visual programming languages, as they possess sufficient expressive powers and intuitive forms. Efficient parsing mechanisms are essential to these formalisms. However, the ...
A general parsing algorithm with context matching for context-sensitive graph grammars
Abstract
Context-sensitive graph grammars have been intuitive and rigorous formalisms for specifying visual programming languages, as they are sufficient expressive and equipped with parsing mechanisms. Parsing has been a fundamental issue in the research ...
Tunnel Parsing with Ambiguous Grammars
Abstract
The article proposes an addition to the tunnel parsing algorithm that enables it to parse grammars having countable repetitions and configurations of grammar elements generating empty words without refactoring the grammar. The equivalency of trees ...

Comments

Information & Contributors

Information

Published In

VINCI '19: Proceedings of the 12th International Symposium on Visual Information Communication and Interaction

September 2019

201 pages

ISBN:9781450376266

DOI:10.1145/3356422

Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

In-Cooperation

East China Normal University

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 20 September 2019

Check for updates

Author Tags

Qualifiers

Poster
Research
Refereed limited

Conference

VINCI'2019

VINCI'2019: The 12th International Symposium on Visual Information Communication and Interaction

September 20 - 22, 2019

Shanghai, China

Acceptance Rates

Overall Acceptance Rate 71 of 193 submissions, 37%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
51
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Mar 2025

Other Metrics

View Author Metrics

Citations

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Recommendations

Partial precedence of context-sensitive graph grammars

A general parsing algorithm with context matching for context-sensitive graph grammars

Tunnel Parsing with Ambiguous Grammars

Comments

Information

Published In

In-Cooperation

Publisher

Publication History

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations