International Conference on Theory and Application of Diagrams

Diagrams 2014: Diagrammatic Representation and Inference pp 48-50 | Cite as

Graphical Representations of Context-Free Languages

  • Benedek Nagy
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8578)


Regular languages can be represented by finite automata and by railroad diagrams. These two visual forms can be converted to each other. Context-free languages can also be described by (finite sets of) railroad diagrams. Based on the analogy we develop a new type of automata, the fractal automata: they accept the context-free languages. Relations between pushdown automata and fractal automata are also established.


fractal automata syntax diagrams pushdown automata 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer (1997)Google Scholar
  2. 2.
    Wirth, N.: The Programming Language Pascal (July 1973)Google Scholar
  3. 3.
    Nagy, B.: Programnyelvek elemeinek szintaktikus leírása normál formában (Syntactic Description of Programming Languages in a Normal Form, in Hungarian). In: Conference on Informatics in Higher Education 2005, Debrecen, 6+1 pages (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Benedek Nagy
    • 1
    • 2
  1. 1.Eastern Mediterranean UniversityFamagustaTurkey
  2. 2.Faculty of InformaticsUniversity of DebrecenDebrecenHungary

Personalised recommendations