Name
Abstract | ||
|---|---|---|
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 existent parsing algorithms are either inefficient or confined to a minority of graph grammars. This paper introduces the notion of partial precedence, defines the partial precedence graph of a graph grammar and theoretically unveils the existence of a valid parsing path conforming to the topological orderings of the partial precedence graph. Then, it provides algorithms for computing the partial precedence graph and presents an approach to improving general parsing algorithms with the graph based on the drawn conclusion. It is shown that the approach can considerably improve the efficiency of general parsing algorithms. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1145/3105971.3105983 | VINCI |
Field | DocType | ISBN |
Programming language,S-attributed grammar,Graph property,Computer science,Directed graph,Theoretical computer science,Null graph,Graph rewriting,Precedence graph,Voltage graph,Graph (abstract data type) | Conference | 978-1-4503-5292-5 |
Citations | PageRank | References |
0 | 0.34 | 15 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yang Zou | 1 | 17 | 4.99 |
| Xiaoqin Zeng | 2 | 407 | 32.97 |
| Yufeng Liu | 3 | 0 | 4.39 |
| HuiYi Liu | 4 | 2 | 1.75 |