Antlr3.Runtime by Sam Harwell, Terence Parr

<PackageReference Include="Antlr3.Runtime" Version="3.5.2-rc1" />

.NET API 98,304 bytes

 DFA

public class DFA
A DFA implemented as a set of transition tables.
protected short[] accept

public bool debug

protected int decisionNumber

protected short[] eof

protected short[] eot

protected char[] max

protected char[] min

protected BaseRecognizer recognizer

Which recognizer encloses this DFA? Needed to check backtracking

protected short[] special

protected short[][] transition

public virtual string Description { get; }

public SpecialStateTransitionHandler SpecialStateTransition { get; }

public DFA()

public DFA(SpecialStateTransitionHandler specialStateTransition)

public static short[] UnpackEncodedString(string encodedString)

Given a String that has a run-length-encoding of some unsigned shorts like "\1\2\3\9", convert to short[] {2,9,9,9}. We do this to avoid static short[] which generates so much init code that the class won't compile. :(

public static char[] UnpackEncodedStringToUnsignedChars(string encodedString)

Hideous duplication of code, but I need different typed arrays out :(

protected virtual void DebugRecognitionException(RecognitionException ex)

public virtual void Error(NoViableAltException nvae)

A hook for debugging interface

protected virtual void NoViableAlt(int s, IIntStream input)

public virtual int Predict(IIntStream input)

From the input stream, predict what alternative will succeed using this DFA (representing the covering regular approximation to the underlying CFL). Return an alternative number 1..n. Throw an exception upon error.