From Ambiguous Regular Expressions to Deterministic Parsing Automata (Q2947407): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1153797264
@@ Property / OpenAlex ID: W1153797264 / rank @@
+Normal rank
@@ Property / cites work @@
+A Unified Construction of the Glushkov, Follow, and Antimirov Automata
+Normal rank
@@ Property / cites work @@
+From regular expressions to deterministic automata
+Normal rank
@@ Property / cites work @@
+Local languages and the Berry-Sethi algorithm
@@ Property / cites work: Local languages and the Berry-Sethi algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Ambiguity in Graphs and Expressions
@@ Property / cites work: Ambiguity in Graphs and Expressions / rank @@
+Normal rank
@@ Property / cites work @@
+Shift-Reduce Parsers for Transition Networks
@@ Property / cites work: Shift-Reduce Parsers for Transition Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Efficiently building a parse tree from a regular expression
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Disambiguation in Regular Expression Matching via Position Automata with Augmented Transitions
+Normal rank
@@ Property / cites work @@
+Q3644388
@@ Property / cites work: Q3644388 / rank @@
+Normal rank
@@ Property / cites work @@
+POSIX Regular Expression Parsing with Derivatives
@@ Property / cites work: POSIX Regular Expression Parsing with Derivatives / rank @@
+Normal rank