Confluent Orthogonal Drawings of Syntax Diagrams
From MaRDI portal
Abstract: We provide a pipeline for generating syntax diagrams (also called railroad diagrams) from context free grammars. Syntax diagrams are a graphical representation of a context free language, which we formalize abstractly as a set of mutually recursive nondeterministic finite automata and draw by combining elements from the confluent drawing, layered drawing, and smooth orthogonal drawing styles. Within our pipeline we introduce several heuristics that modify the grammar but preserve the language, improving the aesthetics of the final drawing.
Recommendations
- On confluent drawings: visualizing graphs using an ortho-confluent system
- A structural and nominal syntax for diagrams
- Graph Drawing
- Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
- Orthogonal graph drawing with flexibility constraints
- Orthogonal graph drawing with flexibility constraints
- Publication:4952592
- scientific article; zbMATH DE number 1787167
- scientific article; zbMATH DE number 2086738
Cited in
(7)- Algorithms and bounds for drawing directed graphs
- Minimization of syntax diagrams with multiport components
- A new framework for hierarchical drawings
- The widths of strict outerconfluent graphs
- A syntactic approach based on distortion-tolerant Adjacency Grammars and a spatial-directed parser to interpret sketched diagrams
- On orthogonally convex drawings of plane graphs
- scientific article; zbMATH DE number 1519410 (Why is no real title available?)
This page was built for publication: Confluent Orthogonal Drawings of Syntax Diagrams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2959761)
