1324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver/* 2324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * [The "BSD licence"] 3324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Copyright (c) 2005-2008 Terence Parr 4324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * All rights reserved. 5324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 6324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Conversion to C#: 7324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Copyright (c) 2008-2009 Sam Harwell, Pixel Mine, Inc. 8324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * All rights reserved. 9324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 10324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Redistribution and use in source and binary forms, with or without 11324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * modification, are permitted provided that the following conditions 12324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * are met: 13324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 1. Redistributions of source code must retain the above copyright 14324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * notice, this list of conditions and the following disclaimer. 15324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 2. Redistributions in binary form must reproduce the above copyright 16324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * notice, this list of conditions and the following disclaimer in the 17324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * documentation and/or other materials provided with the distribution. 18324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 3. The name of the author may not be used to endorse or promote products 19324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * derived from this software without specific prior written permission. 20324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 21324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 22324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 23324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 24324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 25324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 26324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 27324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 28324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 29324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 30324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 31324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver */ 32324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 33324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruvernamespace Antlr.Runtime { 34324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver using ConditionalAttribute = System.Diagnostics.ConditionalAttribute; 35324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver using Console = System.Console; 36324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver using IDebugEventListener = Antlr.Runtime.Debug.IDebugEventListener; 37324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 38324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public delegate int SpecialStateTransitionHandler(DFA dfa, int s, IIntStream input); 39324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 40324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary>A DFA implemented as a set of transition tables.</summary> 41324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 42324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * <remarks> 43324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Any state that has a semantic predicate edge is special; those states 44324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * are generated with if-then-else structures in a specialStateTransition() 45324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * which is generated by cyclicDFA template. 46324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 47324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * There are at most 32767 states (16-bit signed short). 48324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Could get away with byte sometimes but would have to generate different 49324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * types and the simulation code too. For a point of reference, the Java 50324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * lexer's Tokens rule DFA has 326 states roughly. 51324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * </remarks> 52324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver */ 53324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public class DFA { 54324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public DFA() 55324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver : this(new SpecialStateTransitionHandler(SpecialStateTransitionDefault)) { 56324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 57324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public DFA(SpecialStateTransitionHandler specialStateTransition) { 58324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver this.SpecialStateTransition = specialStateTransition ?? new SpecialStateTransitionHandler(SpecialStateTransitionDefault); 59324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 60324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 61324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver protected short[] eot; 62324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver protected short[] eof; 63324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver protected char[] min; 64324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver protected char[] max; 65324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver protected short[] accept; 66324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver protected short[] special; 67324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver protected short[][] transition; 68324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 69324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver protected int decisionNumber; 70324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 71324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary>Which recognizer encloses this DFA? Needed to check backtracking</summary> */ 72324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver protected BaseRecognizer recognizer; 73324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 74324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public readonly bool debug = false; 75324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 76324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary> 77324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * From the input stream, predict what alternative will succeed 78324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * using this DFA (representing the covering regular approximation 79324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * to the underlying CFL). Return an alternative number 1..n. Throw 80324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * an exception upon error. 81324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * </summary> 82324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver */ 83324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual int Predict(IIntStream input) { 84324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (debug) { 85324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver Console.Error.WriteLine("Enter DFA.predict for decision " + decisionNumber); 86324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 87324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver int mark = input.Mark(); // remember where decision started in input 88324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver int s = 0; // we always start at s0 89324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver try { 90324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver for (; ; ) { 91324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (debug) 92324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver Console.Error.WriteLine("DFA " + decisionNumber + " state " + s + " LA(1)=" + (char)input.LA(1) + "(" + input.LA(1) + 93324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver "), index=" + input.Index); 94324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver int specialState = special[s]; 95324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (specialState >= 0) { 96324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (debug) { 97324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver Console.Error.WriteLine("DFA " + decisionNumber + 98324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver " state " + s + " is special state " + specialState); 99324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 100324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver s = SpecialStateTransition(this, specialState, input); 101324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (debug) { 102324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver Console.Error.WriteLine("DFA " + decisionNumber + 103324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver " returns from special state " + specialState + " to " + s); 104324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 105324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (s == -1) { 106324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver NoViableAlt(s, input); 107324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return 0; 108324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 109324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver input.Consume(); 110324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver continue; 111324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 112324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (accept[s] >= 1) { 113324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (debug) 114324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver Console.Error.WriteLine("accept; predict " + accept[s] + " from state " + s); 115324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return accept[s]; 116324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 117324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // look for a normal char transition 118324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver char c = (char)input.LA(1); // -1 == \uFFFF, all tokens fit in 65000 space 119324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (c >= min[s] && c <= max[s]) { 120324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver int snext = transition[s][c - min[s]]; // move to next state 121324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (snext < 0) { 122324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // was in range but not a normal transition 123324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // must check EOT, which is like the else clause. 124324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // eot[s]>=0 indicates that an EOT edge goes to another 125324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // state. 126324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (eot[s] >= 0) { // EOT Transition to accept state? 127324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (debug) 128324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver Console.Error.WriteLine("EOT transition"); 129324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver s = eot[s]; 130324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver input.Consume(); 131324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // TODO: I had this as return accept[eot[s]] 132324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // which assumed here that the EOT edge always 133324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // went to an accept...faster to do this, but 134324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // what about predicated edges coming from EOT 135324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // target? 136324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver continue; 137324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 138324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver NoViableAlt(s, input); 139324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return 0; 140324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 141324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver s = snext; 142324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver input.Consume(); 143324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver continue; 144324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 145324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (eot[s] >= 0) { // EOT Transition? 146324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (debug) 147324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver Console.Error.WriteLine("EOT transition"); 148324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver s = eot[s]; 149324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver input.Consume(); 150324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver continue; 151324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 152324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (c == unchecked((char)TokenTypes.EndOfFile) && eof[s] >= 0) { // EOF Transition to accept state? 153324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (debug) 154324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver Console.Error.WriteLine("accept via EOF; predict " + accept[eof[s]] + " from " + eof[s]); 155324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return accept[eof[s]]; 156324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 157324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // not in range and not EOF/EOT, must be invalid symbol 158324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (debug) { 159324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver Console.Error.WriteLine("min[" + s + "]=" + min[s]); 160324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver Console.Error.WriteLine("max[" + s + "]=" + max[s]); 161324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver Console.Error.WriteLine("eot[" + s + "]=" + eot[s]); 162324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver Console.Error.WriteLine("eof[" + s + "]=" + eof[s]); 163324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver for (int p = 0; p < transition[s].Length; p++) { 164324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver Console.Error.Write(transition[s][p] + " "); 165324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 166324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver Console.Error.WriteLine(); 167324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 168324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver NoViableAlt(s, input); 169324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return 0; 170324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 171324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } finally { 172324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver input.Rewind(mark); 173324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 174324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 175324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 176324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver protected virtual void NoViableAlt(int s, IIntStream input) { 177324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (recognizer.state.backtracking > 0) { 178324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver recognizer.state.failed = true; 179324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return; 180324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 181324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver NoViableAltException nvae = 182324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver new NoViableAltException(Description, 183324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver decisionNumber, 184324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver s, 185324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver input); 186324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver Error(nvae); 187324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver throw nvae; 188324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 189324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 190324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary>A hook for debugging interface</summary> */ 191324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual void Error(NoViableAltException nvae) { 192324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 193324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 194324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public SpecialStateTransitionHandler SpecialStateTransition { 195324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver get; 196324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver private set; 197324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 198324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver //public virtual int specialStateTransition( int s, IntStream input ) 199324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver //{ 200324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // return -1; 201324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver //} 202324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 203324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver static int SpecialStateTransitionDefault(DFA dfa, int s, IIntStream input) { 204324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return -1; 205324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 206324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 207324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual string Description { 208324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver get { 209324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return "n/a"; 210324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 211324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 212324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 213324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary> 214324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Given a String that has a run-length-encoding of some unsigned shorts 215324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * like "\1\2\3\9", convert to short[] {2,9,9,9}. We do this to avoid 216324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * static short[] which generates so much init code that the class won't 217324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * compile. :( 218324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * </summary> 219324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver */ 220324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public static short[] UnpackEncodedString(string encodedString) { 221324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // walk first to find how big it is. 222324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver int size = 0; 223324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver for (int i = 0; i < encodedString.Length; i += 2) { 224324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver size += encodedString[i]; 225324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 226324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver short[] data = new short[size]; 227324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver int di = 0; 228324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver for (int i = 0; i < encodedString.Length; i += 2) { 229324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver char n = encodedString[i]; 230324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver char v = encodedString[i + 1]; 231324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // add v n times to data 232324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver for (int j = 1; j <= n; j++) { 233324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver data[di++] = (short)v; 234324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 235324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 236324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return data; 237324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 238324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 239324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary>Hideous duplication of code, but I need different typed arrays out :(</summary> */ 240324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public static char[] UnpackEncodedStringToUnsignedChars(string encodedString) { 241324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // walk first to find how big it is. 242324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver int size = 0; 243324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver for (int i = 0; i < encodedString.Length; i += 2) { 244324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver size += encodedString[i]; 245324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 246324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver char[] data = new char[size]; 247324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver int di = 0; 248324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver for (int i = 0; i < encodedString.Length; i += 2) { 249324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver char n = encodedString[i]; 250324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver char v = encodedString[i + 1]; 251324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // add v n times to data 252324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver for (int j = 1; j <= n; j++) { 253324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver data[di++] = v; 254324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 255324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 256324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return data; 257324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 258324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 259324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver [Conditional("ANTLR_DEBUG")] 260324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver protected virtual void DebugRecognitionException(RecognitionException ex) { 261324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver IDebugEventListener dbg = recognizer.DebugListener; 262324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (dbg != null) 263324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver dbg.RecognitionException(ex); 264324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 265324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 266324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver} 267