Confluent Orthogonal Drawings of Syntax Diagrams
نویسندگان
چکیده
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.
منابع مشابه
Drawing Tree Diagrams: Problems and Suggestions
Starting from the theoretical goal of syntax, and taking the difference between pedagogical grammar and syntax into consideration, this article, based on the author’s teaching practice and review of exam papers, analyzes common problems in drawing tree diagrams such as ternary branching and improper marking of grammatical categories, followed by proposals for constructing such representations, ...
متن کاملConfluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
We introduce a new approach for drawing diagrams. Our approach is to use a technique we call confluent drawing for visualizing non-planar graphs in a planar way. This approach allows us to draw, in a crossing-free manner, graphs—such as software interaction diagrams—that would normally have many crossings. The main idea of this approach is quite simple: we allow groups of edges to be merged tog...
متن کاملA Software System for Computing Labeled Orthogonal Drawings of Graphs
The paper presents a software system for computing orthogonal drawings of graphs with labels on vertices and edges, while minimizing the area or the total edge length of the drawing. The system is thought mainly to support CASE tools in the automatic visualization of diagrams like UML diagrams and ER-diagrams.
متن کاملThe Three-Phase Method: A Unified Approach to Orthogonal Graph Drawing
In this paper, we study orthogonal graph drawings from a practical point of view. Most previously existing algorithms restricted the attention to graphs of maximum degree four. Here we study orthogonal drawing algorithms that work for any input graph, and discuss diierent models for such drawings. Then we introduce the three-phase method, a generic technique to create high-degree orthogonal dra...
متن کاملConfluent Hasse Diagrams
We show that a transitively reduced digraph has a confluent upward drawing if and only if its reachability relation has order dimension at most two. In this case, we construct a confluent upward drawing with O(n2) features, in an O(n)×O(n) grid in O(n2) time. For the digraphs representing series-parallel partial orders we show how to construct a drawing with O(n) features in an O(n)×O(n) grid i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015