.
prolog ## %{ ... %} prior to the first %%
+.
+. /** error output stream.
+. It should be changeable.
+. */
+. public System.IO.TextWriter ErrorOutput = System.Console.Out;
.
. /** simplified error message.
. @see <a href="#yyerror(java.lang.String, java.lang.String[])">yyerror</a>
. public void yyerror (string message) {
. yyerror(message, null);
. }
-.
+.#pragma warning disable 649
+. /* An EOF token */
+. public int eof_token;
+.#pragma warning restore 649
. /** (syntax) error message.
. Can be overwritten to control message format.
. @param message text to be displayed.
. @param expected vector of acceptable tokens, if available.
. */
. public void yyerror (string message, string[] expected) {
-. if ((expected != null) && (expected.Length > 0)) {
-. System.Console.Write (message+", expecting");
+. if ((yacc_verbose_flag > 0) && (expected != null) && (expected.Length > 0)) {
+. ErrorOutput.Write (message+", expecting");
. for (int n = 0; n < expected.Length; ++ n)
-. System.Console.Write (" "+expected[n]);
-. System.Console.WriteLine ();
+. ErrorOutput.Write (" "+expected[n]);
+. ErrorOutput.WriteLine ();
. } else
-. System.Console.WriteLine (message);
+. ErrorOutput.WriteLine (message);
. }
.
. /** debugging support, requires the package jay.yydebug.
. Set to null to suppress debugging messages.
. */
-t protected yydebug.yyDebug debug;
+t internal yydebug.yyDebug debug;
.
debug ## tables for debugging support
.
-. /** index-checked interface to yyName[].
+. /** index-checked interface to yyNames[].
. @param token single character or %token value.
. @return token name or [illegal] or [unknown].
. */
t public static string yyname (int token) {
-t if ((token < 0) || (token > yyName.Length)) return "[illegal]";
+t if ((token < 0) || (token > yyNames.Length)) return "[illegal]";
t string name;
-t if ((name = yyName[token]) != null) return name;
+t if ((name = yyNames[token]) != null) return name;
t return "[unknown]";
t }
.
+.#pragma warning disable 414
+. int yyExpectingState;
+.#pragma warning restore 414
. /** computes list of expected tokens on error by tracing the tables.
. @param state for which to compute the list.
. @return list of token names.
. */
-. protected string[] yyExpecting (int state) {
+. protected int [] yyExpectingTokens (int state){
. int token, n, len = 0;
-. bool[] ok = new bool[yyName.Length];
-.
+. bool[] ok = new bool[yyNames.Length];
. if ((n = yySindex[state]) != 0)
. for (token = n < 0 ? -n : 0;
-. (token < yyName.Length) && (n+token < yyTable.Length); ++ token)
-. if (yyCheck[n+token] == token && !ok[token] && yyName[token] != null) {
+. (token < yyNames.Length) && (n+token < yyTable.Length); ++ token)
+. if (yyCheck[n+token] == token && !ok[token] && yyNames[token] != null) {
. ++ len;
. ok[token] = true;
. }
. if ((n = yyRindex[state]) != 0)
. for (token = n < 0 ? -n : 0;
-. (token < yyName.Length) && (n+token < yyTable.Length); ++ token)
-. if (yyCheck[n+token] == token && !ok[token] && yyName[token] != null) {
+. (token < yyNames.Length) && (n+token < yyTable.Length); ++ token)
+. if (yyCheck[n+token] == token && !ok[token] && yyNames[token] != null) {
. ++ len;
. ok[token] = true;
. }
-.
-. string [] result = new string[len];
+. int [] result = new int [len];
. for (n = token = 0; n < len; ++ token)
-. if (ok[token]) result[n++] = yyName[token];
+. if (ok[token]) result[n++] = token;
+. return result;
+. }
+. protected string[] yyExpecting (int state) {
+. int [] tokens = yyExpectingTokens (state);
+. string [] result = new string[tokens.Length];
+. for (int n = 0; n < tokens.Length; n++)
+. result[n++] = yyNames[tokens [n]];
. return result;
. }
.
. @return result of the last reduction, if any.
. @throws yyException on irrecoverable parse error.
. */
-. public Object yyparse (yyParser.yyInput yyLex, Object yyd)
+. internal Object yyparse (yyParser.yyInput yyLex, Object yyd)
. {
t this.debug = (yydebug.yyDebug)yyd;
. return yyparse(yyLex);
. return first;
. }
.
+. static int[] global_yyStates;
+. static object[] global_yyVals;
+.#pragma warning disable 649
+. protected bool use_global_stacks;
+.#pragma warning restore 649
+. object[] yyVals; // value stack
+. object yyVal; // value stack ptr
+. int yyToken; // current input
+. int yyTop;
+.
. /** the generated parser.
. Maintains a state and a value stack, currently with fixed maximum size.
. @param yyLex scanner.
. @return result of the last reduction, if any.
. @throws yyException on irrecoverable parse error.
. */
-. public Object yyparse (yyParser.yyInput yyLex)
-. {
-. if (yyMax <= 0) yyMax = 256; // initial size
-. int yyState = 0; // state stack ptr
-. int [] yyStates = new int[yyMax]; // state stack
-. Object yyVal = null; // value stack ptr
-. Object [] yyVals = new Object[yyMax]; // value stack
-. int yyToken = -1; // current input
+. internal Object yyparse (yyParser.yyInput yyLex)
+. {
+. if (yyMax <= 0) yyMax = 256; // initial size
+. int yyState = 0; // state stack ptr
+. int [] yyStates; // state stack
+. yyVal = null;
+. yyToken = -1;
. int yyErrorFlag = 0; // #tks to shift
+. if (use_global_stacks && global_yyStates != null) {
+. yyVals = global_yyVals;
+. yyStates = global_yyStates;
+. } else {
+. yyVals = new object [yyMax];
+. yyStates = new int [yyMax];
+. if (use_global_stacks) {
+. global_yyVals = yyVals;
+. global_yyStates = yyStates;
+. }
+. }
.
local ## %{ ... %} after the first %%
-. int yyTop = 0;
-. goto skip;
-. yyLoop:
-. yyTop++;
-. skip:
-. for (;; ++ yyTop) {
+. /*yyLoop:*/ for (yyTop = 0;; ++ yyTop) {
. if (yyTop >= yyStates.Length) { // dynamically increase
-. int[] i = new int[yyStates.Length+yyMax];
-. yyStates.CopyTo (i, 0);
-. yyStates = i;
-. Object[] o = new Object[yyVals.Length+yyMax];
-. yyVals.CopyTo (o, 0);
-. yyVals = o;
+. global::System.Array.Resize (ref yyStates, yyStates.Length+yyMax);
+. global::System.Array.Resize (ref yyVals, yyVals.Length+yyMax);
. }
. yyStates[yyTop] = yyState;
. yyVals[yyTop] = yyVal;
t if (debug != null) debug.push(yyState, yyVal);
.
-. yyDiscarded: for (;;) { // discarding a token does not change stack
+. /*yyDiscarded:*/ while (true) { // discarding a token does not change stack
. int yyN;
. if ((yyN = yyDefRed[yyState]) == 0) { // else [default] reduce (yyN)
. if (yyToken < 0) {
. yyToken = yyLex.advance() ? yyLex.token() : 0;
-. if (yyToken == 0)
-. yyLex.Cleanup ();
+
t if (debug != null)
t debug.lex(yyState, yyToken, yyname(yyToken), yyLex.value());
. }
. yyVal = yyLex.value();
. yyToken = -1;
. if (yyErrorFlag > 0) -- yyErrorFlag;
-. goto yyLoop;
+. goto continue_yyLoop;
. }
. if ((yyN = yyRindex[yyState]) != 0 && (yyN += yyToken) >= 0
. && yyN < yyTable.Length && yyCheck[yyN] == yyToken)
. switch (yyErrorFlag) {
.
. case 0:
-. yyerror("syntax error", yyExpecting(yyState));
+. yyExpectingState = yyState;
+. // yyerror(String.Format ("syntax error, got token `{0}'", yyname (yyToken)), yyExpecting(yyState));
t if (debug != null) debug.error("syntax error");
+. if (yyToken == 0 /*eof*/ || yyToken == eof_token) throw new yyParser.yyUnexpectedEof ();
. goto case 1;
. case 1: case 2:
. yyErrorFlag = 3;
t debug.shift(yyStates[yyTop], yyTable[yyN], 3);
. yyState = yyTable[yyN];
. yyVal = yyLex.value();
-. goto yyLoop;
+. goto continue_yyLoop;
. }
t if (debug != null) debug.pop(yyStates[yyTop]);
. } while (-- yyTop >= 0);
t debug.discard(yyState, yyToken, yyname(yyToken),
t yyLex.value());
. yyToken = -1;
-. goto yyDiscarded; // leave stack alone
+. goto continue_yyDiscarded; // leave stack alone
. }
. }
. int yyV = yyTop + 1-yyLen[yyN];
t if (debug != null)
-t debug.reduce(yyState, yyStates[yyV-1], yyN, yyRule[yyN], yyLen[yyN]);
-. yyVal = yyDefault(yyV > yyTop ? null : yyVals[yyV]);
+t debug.reduce(yyState, yyStates[yyV-1], yyN, YYRules.getRule (yyN), yyLen[yyN]);
+. yyVal = yyV > yyTop ? null : yyVals[yyV]; // yyVal = yyDefault(yyV > yyTop ? null : yyVals[yyV]);
. switch (yyN) {
actions ## code from the actions within the grammar
. yyState = yyFinal;
. if (yyToken < 0) {
. yyToken = yyLex.advance() ? yyLex.token() : 0;
-. if (yyToken == 0)
-. yyLex.Cleanup ();
t if (debug != null)
t debug.lex(yyState, yyToken,yyname(yyToken), yyLex.value());
t if (debug != null) debug.accept(yyVal);
. return yyVal;
. }
-. goto yyLoop;
+. goto continue_yyLoop;
. }
. if (((yyN = yyGindex[yyM]) != 0) && ((yyN += yyState) >= 0)
. && (yyN < yyTable.Length) && (yyCheck[yyN] == yyState))
. else
. yyState = yyDgoto[yyM];
t if (debug != null) debug.shift(yyStates[yyTop], yyState);
-. goto yyLoop;
+. goto continue_yyLoop;
+. continue_yyDiscarded: ; // implements the named-loop continue: 'continue yyDiscarded'
. }
+. continue_yyLoop: ; // implements the named-loop continue: 'continue yyLoop'
. }
. }
.
epilog ## text following second %%
.namespace yydebug {
. using System;
-. public interface yyDebug {
+. internal interface yyDebug {
. void push (int state, Object value);
. void lex (int state, int token, string name, Object value);
. void shift (int from, int to, int errorFlag);
.
. class yyDebugSimple : yyDebug {
. void println (string s){
-. Console.WriteLine (s);
+. Console.Error.WriteLine (s);
. }
.
. public void push (int state, Object value) {
. using System;
. /** thrown for irrecoverable syntax errors and stack overflow.
. */
-. public class yyException : System.Exception {
+. internal class yyException : System.Exception {
. public yyException (string message) : base (message) {
. }
. }
+. internal class yyUnexpectedEof : yyException {
+. public yyUnexpectedEof (string message) : base (message) {
+. }
+. public yyUnexpectedEof () : base ("") {
+. }
+. }
.
. /** must be implemented by a scanner object to supply input to the parser.
. */
-. public interface yyInput {
+. internal interface yyInput {
. /** move on to next token.
. @return false if positioned beyond tokens.
. @throws IOException on input error.
. @return value for token().
. */
. Object value ();
-. /** Cleanup, this is called when advance returns false.
-. */
-. void Cleanup ();
. }
. }
.} // close outermost namespace, that MUST HAVE BEEN opened in the prolog
projects / mono.git / blobdiff