lflat
L-FLAT - Logtalk Formal Language and Automata Toolkit (by l-flat)
ata
Experimental RegExp Engine with event triggering mechanism. (by kazhmir)
| lflat | ata | |
|---|---|---|
| 1 | 1 | |
| 7 | 2 | |
| - | - | |
| 0.0 | 6.2 | |
| almost 2 years ago | over 3 years ago | |
| Logtalk | Go | |
| MIT License | The Unlicense |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
lflat
Posts with mentions or reviews of lflat.
We have used some of these posts to build our list of alternatives
and similar projects.
ata
Posts with mentions or reviews of ata.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-01-07.
-
Practical Example Of My New Event Driven Regex Engine - SAR
very interesting, i did something very much like this in Go: https://github.com/kazhmir/ATA
What are some alternatives?
When comparing lflat and ata you can also consider the following projects:
turing_machine - A simple C program to emulate two symbol turing machine
regexp2 - A full-featured regex engine in pure Go based on the .NET engine
regexp_sar - SAR is a new way of handling regular expression which allows us to run many regular expressions (only limitation being the available memory) at once. When adding a regexp, there is also a related callback that will be called upon each match in the same order in which they appear on the text
CXXAutomata - A C++ library for simulating automata and Turing machines
regex - An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
codesearch - Fork of Google codesearch with more options