Fare - [F]inite [A]utomata and [R]egular [E]xpressions
Project Fare is an effort to bring a DFA/NFA (finite-state automata) implementation from Java to .NET. There are quite a few implementations available in other languages today. This project aims to fill the gap in .NET.
Fare is a .NET port of the well established Java library dk.brics.automaton with API as close as possible to the corresponding dk.brics.automaton classes.
Is my Regular Expression supported?
If your Regular Expression isn't supported, it would make sense to debug the C# code but also compare with the results from xeger.
As an alternative, you may use a different pattern or even use a different engine to reverse the Regular Expression into an Automaton. As an example, you can use the Rex engine.
- Included a .NET port of Xeger, for generating random text from regular expressions. Xeger does not support all valid Java regular expressions. The full set of what is defined here and is summarized at (http://code.google.com/p/xeger/wiki/XegerLimitations).
- Implemented object equality.
- Many getters and setters have been replaced by .NET properties.
- Many foreach loops have been converted to LINQ-expressions.
- Notes from porting Java code in .NET can be found here.
Based on version 1.11-8 of dk.brics.automaton released on September 7, 2011. ChangeLog
Fare is available via NuGet.
Fare reached version 1 without following a particular versioning scheme. From version 1 and above, Fare follows Semantic Versioning 2.0.0.
Which projects use Fare?
Fare is used in: