Skip to main content
SpringerLink
Log in
Book cover

Visual Information Communication pp 135–147Cite as

Constructing Confluent Context-sensitive Graph Grammars from Non-confluent Productions for Parsing Efficiency

  • Conference paper
  • First Online:

  • 2368 Accesses

Abstract

The efficient parsing algorithms are usually confined to confluent graph grammars in context-sensitive formalisms, whereas the confluence condition is not frequently met by graph grammars in practical applications. This paper, based on the Reserved Graph Grammar (RGG) formalism, proposes an extended formalism XRGG which allows imposing constraints characterizing application situations on graph productions. The constraints can make the redexes of the XRGG productions' right graphs mutually exclusive so as to ensure the confluence of the corresponding graph grammar. Then an algorithm is developed to construct a confluent XRGG graph grammar from an RGG grammar with non-confluent productions for tackling identical graph languages. This method can be easily generalized to other context-sensitive graph grammar formalisms, thus making the efficient parsing algorithm of the RGG that depends on confluent graph grammars more widely applicable.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  3. Zhang K., Zhang D.Q., Deng Y.: A Visual Approach to XML Document Design and Transformation. In: 18th IEEE International Symposium on Human-Centric Computing Languages and Environments, pp. 312–319. IEEE Press, Washington, DC (2001)

    Chapter  Google Scholar 

  4. Zhang K., Kong J., Qiu M.K., G.L. Song: Multimedia Layout Adaptation through Grammatical Specifications. ACM/Springer Multimedia Systems 10(3), 245–260 (2005)

    Article  Google Scholar 

  5. Kong J., Zhang K., Zeng X.: Spatial Graph Grammars for Graphical User Interfaces. ACM Transactions on Computer-Human Interaction 13(2), 268–307 (2006)

    Article  Google Scholar 

  6. Song G.L., Zhang K., Kong J.: Model Management through Graph Transformations. In: 21st IEEE International Symposium on Visual Languages and Human-Centric Computing, pp. 75–82. IEEE Press, Washington, DC (2004)

    Chapter  Google Scholar 

  7. Zhao C.Y., Kong J., Dong J., Zhang K.: Pattern Based Design Evolution Using Graph Transformation. Journal of Visual Languages and Computing 18(4), 378–398 (2007)

    Article  Google Scholar 

  8. Zou Y., Zeng X.Q., Han X.Q., Zhang K.: Context-Attributed Graph Grammar Framework for Specifying Visual Languages. Journal of Southeast University (English Edition) 24(4), 455-461 (2008)

    Google Scholar 

  9. Zeng X.Q., Han X.Q., Zou Y.: An Edge-Based Context-Sensitive Graph Grammar Formalism. Journal of Software 19(8), 1893–1901 (2008) (in Chinese)

    Article  MathSciNet  Google Scholar 

  10. Zeng X.Q., Zhang K., Kong J., Song G.L.: RGG+: An Enhancement to the Reserved Graph Grammar Formalism. In: 22nd IEEE International Symposium on Visual Languages and Human-Centric Computing, pp. 272–274. IEEE Press, Washington, DC (2005)

    Chapter  Google Scholar 

  11. Bottoni P., Taentzer G., Schürr A.: Efficient Parsing of Visual Languages based on Critical Pair Analysis and Contextual Layered Graph Transformation. In: 17th IEEE International Symposium on Visual Languages, pp.5–60. IEEE Press, Washington, DC (2000)

    Google Scholar 

Download references

Acknowledgments

This work is supported by the National Grand Fundamental Research Program of China (973) under grant 2009CB320702, and the National Natural Science Foundation of China under grants 60571948, 60673186, 60736015 and 60721002.

Author information

Authors and Affiliations

  1. State Key Laboratory for Novel Software Technology, Nanjing University, 210093, Nanjing, China

    Yang Zou, Jian Lü, Xiaoxing Ma & Qiliang Yang

  2. Research Institute of Pattern Recognition and Intelligent System, Computer and Information Engineering College, Hohai University, 210098, Nanjing, China

    Yang Zou & Xiaoqin Zeng

  3. Institute of Engineering Corps, PLA University of Sci. & Tech., 210007, Nanjing, China

    Qiliang Yang

Authors
  1. Yang Zou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jian Lü
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xiaoqin Zeng
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Xiaoxing Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Qiliang Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yang Zou .

Editor information

Editors and Affiliations

  1. Dept. Information & Technology, University of Technology, Sydney, Broadway, 2007, Australia

    Mao Lin Huang

  2. School of Computing & Mathematics, University of Western Sydney, South Penrith DC, 1797, Australia

    Quang Vinh Nguyen

  3. Dept. Computer Science, University of Texas, Dallas, West Campbell Road 800, Richardson, 75080, U.S.A.

    Kang Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag US

About this paper

Cite this paper

Zou, Y., Lü, J., Zeng, X., Ma, X., Yang, Q. (2009). Constructing Confluent Context-sensitive Graph Grammars from Non-confluent Productions for Parsing Efficiency. In: Huang, M., Nguyen, Q., Zhang, K. (eds) Visual Information Communication. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-0312-9_8

Download citation

  • DOI: https://doi.org/10.1007/978-1-4419-0312-9_8

  • Published:

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-0311-2

  • Online ISBN: 978-1-4419-0312-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation