+2003-10-08 Atsushi Enomoto <ginga@kit.hi-ho.ne.jp>
+
+ * output.c, skelton, skelton.cs : Renamed yyName[] to yyNames[]
+ to make output CLS-compliant.
+
2003-05-16 Peter Williams <peterw@ximian.com>
* main.c (print_skel_dir): New function called when jay is
if (symbol_value[i] > max)
max = symbol_value[i];
- /* need yyName for yyExpecting() */
+ /* need yyNames for yyExpecting() */
- printf(" protected static %s string [] yyName = {", csharp ? "" : "final");
+ printf(" protected static %s string [] yyNames = {", csharp ? "" : "final");
symnam = (char **) MALLOC((max+1)*sizeof(char *));
if (symnam == 0) no_space();
.
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 final 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 }
.
. */
. protected String[] yyExpecting (int state) {
. int token, n, len = 0;
-. boolean[] ok = new boolean[yyName.length];
+. boolean[] ok = new boolean[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];
. for (n = token = 0; n < len; ++ token)
-. if (ok[token]) result[n++] = yyName[token];
+. if (ok[token]) result[n++] = yyNames[token];
. return result;
. }
.
.
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 }
.
. */
. protected string[] yyExpecting (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];
. for (n = token = 0; n < len; ++ token)
-. if (ok[token]) result[n++] = yyName[token];
+. if (ok[token]) result[n++] = yyNames[token];
. return result;
. }
.