-
https://android.googlesource.com/platform/external/pcre/+/android-8.0.0_r34/dist2/
-
Add a new function that creates a new DFA from the existing DFA that has been minimized to the states that are really needed.
For example, the RegEx `ab|cb` creates this DFA:
![dfa](https://user…
-
Hi,
I am collecting information for [my pet project](https://bitbucket.org/vityok/cl-string-match/wiki/Regular_expressions_in_Common_Lisp) and would like to know more about the regex implementation i…
-
The regular expression syntax for:
`predicate regular(array [int] of var int: x, string: r)
`
mentions Union, Groups, Concatenation, Wildcards etc., but **not** Intersection.
Intersection is e…
-
```java
/usr/bin/gradle build
> Task :generateCrystalLexer
Reading skeleton file "lib/jflex/idea-flex.skeleton".
Reading "/home/unshadow/Desktop/git-projects/intellij-crystal/src/main/grammars/…
-
**Is your feature request related to a problem? Please describe.**
After #7 the compiler no longer necessarily outputs a minimal DFA. It's still a correct DFA, just not minimal.
**Describe the sol…
-
Today when a `RegexpQuery` is created, it will be translated to NFA, determinized to DFA and eventually become an `AutomatonQuery`, which is very fast. However, not every NFA could be determinized to …
-
Currently we generate a number of scanners from regexes using re2c.
This has two advantages:
1. It is easy to see at a glance what the scanners do, and easy to modify them.
2. The scanners ge…
-
In my mod I invoke `minetest.clear_craft()` a lot (and I mean A LOT) of times automatically because I programmatically replace the crafting result.
When using `minetest.clear_craft({ output = id })…
ghost updated
2 years ago
-
**Description:**
We propose the following enhancements to improve the efficiency of regular language processing:
- **NFA to DFA Conversion:** Implement the subset construction algorithm to conve…