mittens 0.3.1 → 0.3.2

data/vendor/snowball/compiler/generator_go.c

@@ -1,77 +1,57 @@
 #include <assert.h>
+#include <ctype.h> /* for toupper */
+#include <stdio.h> /* for fprintf etc */
 #include <stdlib.h> /* for exit */
 #include <string.h> /* for strlen */
-#include <stdio.h> /* for fprintf etc */
-#include <ctype.h> /* for toupper */
 #include "header.h"
 
-/* prototypes */
+/* prototype functions for recursive use: */
 
 static void generate(struct generator * g, struct node * p);
 static void w(struct generator * g, const char * s);
 static void writef(struct generator * g, const char * s, struct node * p);
 
-static int new_label(struct generator * g) {
-    return g->next_label++;
-}
+/* Write routines for items from the syntax tree */
 
-static struct str * vars_newname(struct generator * g) {
-    struct str * output;
-    g->var_number++;
-    output = str_new();
-    str_append_string(output, "v_");
-    str_append_int(output, g->var_number);
-    return output;
+static void write_relop(struct generator * g, int relop) {
+    // Relational operators are the same as C.
+    write_c_relop(g, relop);
 }
 
-/* Write routines for items from the syntax tree */
-
 static void write_varname(struct generator * g, struct name * p) {
-    switch (p->type) {
-        case t_external: {
-            char save_initial = p->s[0];
-            p->s[0] = toupper(save_initial);
-            str_append_s(g->outbuf, p->s);
-            p->s[0] = save_initial;
-            return;
-        }
-        default: {
-            int ch = "SbirxG"[p->type];
-            write_char(g, ch);
-            write_char(g, '_');
-            break;
-        }
-    }
+    // We use the same naming scheme for both global and local variables.
+    write_char(g, "SbirrG"[p->type]);
+    write_char(g, '_');
     write_s(g, p->s);
 }
 
+/* Reference to variable, e.g. when assigning to or using in an expression. */
 static void write_varref(struct generator * g, struct name * p) {
-    write_string(g, "context.");
+    if (p->type >= t_routine || p->local_to == NULL) {
+        write_string(g, "context.");
+    }
     write_varname(g, p);
 }
 
 static void write_literal_string(struct generator * g, symbol * p) {
     int i = 0;
-    write_string(g, "\"");
+    write_char(g, '"');
     while (i < SIZE(p)) {
         int ch;
         i += get_utf8(p + i, &ch);
-        if (32 <= ch && ch < 0x590 && ch != 127) {
+        // Write out ASCII and lower Unicode printables as literal characters.
+        // Use escapes for anything over 0x590 as a crude way to avoid LTR
+        // characters affecting the rendering of source character order in
+        // confusing ways.
+        if ((32 <= ch && ch < 127) || (0xa0 < ch && ch < 0x590)) {
             if (ch == '"' || ch == '\\') write_char(g, '\\');
             write_wchar_as_utf8(g, ch);
         } else {
-            // Use escapes for anything over 0x590 as a crude way to avoid
-            // LTR characters affecting the rendering of source character
-            // order in confusing ways.
             write_string(g, "\\u");
             write_hex4(g, ch);
         }
     }
-    write_string(g, "\"");
-}
-
-static void write_margin(struct generator * g) {
-    for (int i = 0; i < g->margin; i++) write_string(g, "    ");
+    write_char(g, '"');
 }
 
 static void write_comment(struct generator * g, struct node * p) {
@@ -79,7 +59,7 @@ static void write_comment(struct generator * g, struct node * p) {
     /* FIXME could use Go //line syntax if we had original filename */
     write_margin(g);
     write_string(g, "// ");
-    write_comment_content(g, p);
+    write_comment_content(g, p, NULL);
     write_newline(g);
 }
 
@@ -113,24 +93,27 @@ static void write_restorecursor(struct generator * g, struct node * p, struct st
 
 static void write_inc_cursor(struct generator * g, struct node * p) {
     write_margin(g);
-    write_string(g, p->mode == m_forward ? "env.NextChar();" : "env.PrevChar();");
+    write_string(g, p->mode == m_forward ? "env.NextChar()" : "env.PrevChar()");
     write_newline(g);
 }
 
 static void wsetlab_begin(struct generator * g, int n) {
     g->I[0] = n;
-    w(g, "~Mlab~I0: for {~N~+");
+    w(g, "~-~Mlab~I0:~N~+~Mfor {~N~+");
 }
 
 static void wsetlab_end(struct generator * g, int n) {
-    g->I[0] = n;
-    w(g, "~Mbreak lab~I0~N");
+    if (!g->unreachable) {
+        g->I[0] = n;
+        w(g, "~Mbreak lab~I0~N");
+    }
     w(g, "~-~M}~N");
 }
 
 static void wgotol(struct generator * g, int n) {
     g->I[0] = n;
     w(g, "~Mbreak lab~I0~N");
+    g->unreachable = true;
 }
 
 static void write_failure(struct generator * g) {
@@ -141,14 +124,14 @@ static void write_failure(struct generator * g) {
     }
     switch (g->failure_label) {
         case x_return:
-            w(g, "~Mreturn false~N");
-            g->unreachable = true;
+            w(g, "~Mreturn false");
             break;
         default:
-            g->I[0] = g->failure_label;
-            w(g, "~Mbreak lab~I0~N");
-            g->unreachable = true;
+            w(g, "~Mbreak lab");
+            write_int(g, g->failure_label);
     }
+    write_newline(g);
+    g->unreachable = true;
 }
 
 static void write_failure_if(struct generator * g, const char * s, struct node * p) {
@@ -172,7 +155,6 @@ static void write_check_limit(struct generator * g, struct node * p) {
 
 /* Formatted write. */
 static void writef(struct generator * g, const char * input, struct node * p) {
-    (void)p;
     int i = 0;
 
     while (input[i]) {
@@ -217,27 +199,29 @@ static void writef(struct generator * g, const char * input, struct node * p) {
                 write_int(g, g->I[j]);
                 continue;
             }
-            case 'V':
-            case 'W': {
-                int j = input[i++] - '0';
-                if (j < 0 || j > (int)(sizeof(g->V) / sizeof(g->V[0])))
-                    goto invalid_escape2;
-                if (ch == 'V')
-                    write_varref(g, g->V[j]);
-                else
-                    write_varname(g, g->V[j]);
+            case 'E': {
+                // Write an external name.
+                if (g->options->externals_prefix) {
+                    write_string(g, g->options->externals_prefix);
+                }
+                char save_initial = p->name->s[0];
+                p->name->s[0] = toupper(save_initial);
+                write_s(g, p->name->s);
+                p->name->s[0] = save_initial;
                 continue;
             }
-            case 'L': {
-                int j = input[i++] - '0';
-                if (j < 0 || j > (int)(sizeof(g->L) / sizeof(g->L[0])))
-                    goto invalid_escape2;
-                write_literal_string(g, g->L[j]);
+            case 'V':
+                write_varref(g, p->name);
+                continue;
+            case 'W':
+                write_varname(g, p->name);
+                continue;
+            case 'L':
+                write_literal_string(g, p->literalstring);
                 continue;
-            }
             case '+': g->margin++; continue;
             case '-': g->margin--; continue;
-            case 'n': write_string(g, g->options->name); continue;
+            case 'n': write_s(g, g->options->name); continue;
             default:
                 printf("Invalid escape sequence ~%c in writef(g, \"%s\", p)\n",
                        ch, input);
@@ -258,37 +242,44 @@ static void generate_AE(struct generator * g, struct node * p) {
     const char * s;
     switch (p->type) {
         case c_name:
-            write_varref(g, p->name); break;
+            write_varref(g, p->name);
+            break;
         case c_number:
-            write_int(g, p->number); break;
+            write_int(g, p->number);
+            break;
         case c_maxint:
-            write_string(g, "snowballRuntime.MaxInt"); break;
+            write_string(g, "snowballRuntime.MaxInt");
+            break;
         case c_minint:
-            write_string(g, "snowballRuntime.MinInt"); break;
+            write_string(g, "snowballRuntime.MinInt");
+            break;
         case c_neg:
-            write_char(g, '-'); generate_AE(g, p->right); break;
+            write_char(g, '-');
+            generate_AE(g, p->right);
+            break;
         case c_multiply:
-            s = " * "; goto label0;
-        case c_plus:
-            s = " + "; goto label0;
-        case c_minus:
-            s = " - "; goto label0;
+            s = " * ";
+            goto label0;
         case c_divide:
             s = " / ";
+            goto label0;
+        case c_plus:
+            s = " + ";
+            goto label0;
+        case c_minus:
+            s = " - ";
         label0:
-            write_char(g, '('); generate_AE(g, p->left);
-            write_string(g, s); generate_AE(g, p->right); write_char(g, ')'); break;
+            write_char(g, '(');
+            generate_AE(g, p->left);
+            write_string(g, s);
+            generate_AE(g, p->right);
+            write_char(g, ')');
+            break;
         case c_cursor:
-            w(g, "env.Cursor"); break;
-        case c_limit:
-            w(g, p->mode == m_forward ? "env.Limit" : "env.LimitBackward"); break;
-        case c_lenof:
-            g->V[0] = p->name;
-            w(g, "snowballRuntime.RuneCountInString(~V0)");
+            w(g, "env.Cursor");
             break;
-        case c_sizeof:
-            g->V[0] = p->name;
-            w(g, "len(~V0)");
+        case c_limit:
+            w(g, p->mode == m_forward ? "env.Limit" : "env.LimitBackward");
             break;
         case c_len:
             w(g, "snowballRuntime.RuneCountInString(env.Current())");
@@ -296,6 +287,12 @@ static void generate_AE(struct generator * g, struct node * p) {
         case c_size:
             w(g, "len(env.Current())");
             break;
+        case c_lenof:
+            writef(g, "snowballRuntime.RuneCountInString(~V)", p);
+            break;
+        case c_sizeof:
+            writef(g, "len(~V)", p);
+            break;
     }
 }
 
@@ -310,13 +307,15 @@ static void generate_bra(struct generator * g, struct node * p) {
 
 static void generate_and(struct generator * g, struct node * p) {
     struct str * savevar = NULL;
-    if (K_needed(g, p->left)) {
+    if (K_needed_for_and(p->left)) {
         savevar = vars_newname(g);
     }
 
     write_comment(g, p);
 
-    if (savevar) write_savecursor(g, p, savevar);
+    if (savevar) {
+        write_savecursor(g, p, savevar);
+    }
 
     p = p->left;
     while (p) {
@@ -333,7 +332,7 @@ static void generate_and(struct generator * g, struct node * p) {
 
 static void generate_or(struct generator * g, struct node * p) {
     struct str * savevar = NULL;
-    if (K_needed(g, p->left)) {
+    if (K_needed_for_or(p->left)) {
         savevar = vars_newname(g);
     }
 
@@ -341,12 +340,14 @@ static void generate_or(struct generator * g, struct node * p) {
     struct str * a1 = str_copy(g->failure_str);
 
     int out_lab = new_label(g);
-    int end_unreachable = true;
+    bool end_unreachable = true;
 
     write_comment(g, p);
     wsetlab_begin(g, out_lab);
 
-    if (savevar) write_savecursor(g, p, savevar);
+    if (savevar && K_needed_node_on_f(p)) {
+        write_savecursor(g, p, savevar);
+    }
 
     p = p->left;
     str_clear(g->failure_str);
@@ -366,9 +367,12 @@ static void generate_or(struct generator * g, struct node * p) {
             wgotol(g, out_lab);
             end_unreachable = false;
         }
-        w(g, "~-~M}~N");
+
+        wsetlab_end(g, label);
         g->unreachable = false;
-        if (savevar) write_restorecursor(g, p, savevar);
+        if (savevar) {
+            write_restorecursor(g, p, savevar);
+        }
         p = p->right;
     }
 
@@ -377,6 +381,7 @@ static void generate_or(struct generator * g, struct node * p) {
     g->failure_str = a1;
 
     generate(g, p);
+
     wsetlab_end(g, out_lab);
     if (!end_unreachable) {
         g->unreachable = false;
@@ -395,10 +400,9 @@ static void generate_backwards(struct generator * g, struct node * p) {
     w(g, "~Menv.Cursor = env.LimitBackward~N");
 }
 
-
 static void generate_not(struct generator * g, struct node * p) {
     struct str * savevar = NULL;
-    if (K_needed(g, p->left)) {
+    if (K_needed_node_on_f(p->left)) {
         savevar = vars_newname(g);
     }
 
@@ -423,7 +427,8 @@ static void generate_not(struct generator * g, struct node * p) {
     g->failure_str = a1;
 
     if (!g->unreachable) write_failure(g);
-    w(g, "~-~M}~N");
+
+    wsetlab_end(g, label);
 
     g->unreachable = false;
 
@@ -433,10 +438,9 @@ static void generate_not(struct generator * g, struct node * p) {
     }
 }
 
-
 static void generate_try(struct generator * g, struct node * p) {
     struct str * savevar = NULL;
-    if (K_needed(g, p->left)) {
+    if (K_needed(p->left)) {
         savevar = vars_newname(g);
     }
 
@@ -449,6 +453,7 @@ static void generate_try(struct generator * g, struct node * p) {
         write_savecursor(g, p, savevar);
         append_restore_string(p, g->failure_str, savevar);
     }
+
     wsetlab_begin(g, label);
     generate(g, p->left);
     wsetlab_end(g, label);
@@ -461,14 +466,12 @@ static void generate_try(struct generator * g, struct node * p) {
 
 static void generate_set(struct generator * g, struct node * p) {
     write_comment(g, p);
-    g->V[0] = p->name;
-    writef(g, "~M~V0 = true~N", p);
+    writef(g, "~M~V = true~N", p);
 }
 
 static void generate_unset(struct generator * g, struct node * p) {
     write_comment(g, p);
-    g->V[0] = p->name;
-    writef(g, "~M~V0 = false~N", p);
+    writef(g, "~M~V = false~N", p);
 }
 
 static void generate_fail(struct generator * g, struct node * p) {
@@ -478,10 +481,9 @@ static void generate_fail(struct generator * g, struct node * p) {
 }
 
 /* generate_test() also implements 'reverse' */
-
 static void generate_test(struct generator * g, struct node * p) {
     struct str * savevar = NULL;
-    if (K_needed(g, p->left)) {
+    if (K_needed(p->left)) {
         savevar = vars_newname(g);
     }
 
@@ -503,18 +505,19 @@ static void generate_test(struct generator * g, struct node * p) {
 
 static void generate_do(struct generator * g, struct node * p) {
     struct str * savevar = NULL;
-    if (K_needed(g, p->left)) {
+    if (K_needed(p->left)) {
         savevar = vars_newname(g);
     }
 
     write_comment(g, p);
-    if (savevar) write_savecursor(g, p, savevar);
+    if (savevar) {
+        write_savecursor(g, p, savevar);
+    }
 
     if (p->left->type == c_call) {
         /* Optimise do <call> */
         write_comment(g, p->left);
-        g->V[0] = p->left->name;
-        w(g, "~M~W0(env, context)~N");
+        writef(g, "~M~W(env, context)~N", p->left);
     } else {
         int label = new_label(g);
         g->failure_label = label;
@@ -522,6 +525,7 @@ static void generate_do(struct generator * g, struct node * p) {
 
         wsetlab_begin(g, label);
         generate(g, p->left);
+
         wsetlab_end(g, label);
         g->unreachable = false;
     }
@@ -544,34 +548,34 @@ static void generate_GO_grouping(struct generator * g, struct node * p, int is_g
     struct grouping * q = p->name->grouping;
     g->S[0] = p->mode == m_forward ? "" : "B";
     g->S[1] = complement ? "In" : "Out";
-    g->V[0] = p->name;
     g->I[0] = q->smallest_ch;
     g->I[1] = q->largest_ch;
-    write_failure_if(g, "!env.Go~S1Grouping~S0(~W0, ~I0, ~I1)", p);
+    write_failure_if(g, "!env.Go~S1Grouping~S0(~W, ~I0, ~I1)", p);
     if (!is_goto) {
-        write_string(g, p->mode == m_forward ? "env.NextChar();" : "env.PrevChar();");
+        w(g, p->mode == m_forward ? "~Menv.NextChar()~N" : "~Menv.PrevChar()~N");
     }
 }
 
-static void generate_GO(struct generator * g, struct node * p, int style) {
+static void generate_GO(struct generator * g, struct node * p, int is_goto) {
     write_comment(g, p);
 
     int a0 = g->failure_label;
     struct str * a1 = str_copy(g->failure_str);
 
-    int end_unreachable = false;
+    bool end_unreachable = false;
 
     int golab = new_label(g);
     g->I[0] = golab;
-    w(g, "~Mgolab~I0: for {~N~+");
+    w(g, "~-~Mgolab~I0:~N~+~Mfor {~N~+");
 
     struct str * savevar = NULL;
-    if (style == 1 || repeat_restore(g, p->left)) {
+    if (is_goto || repeat_restore(p->left)) {
         savevar = vars_newname(g);
         write_savecursor(g, p, savevar);
     }
 
-    g->failure_label = new_label(g);
+    int label = new_label(g);
+    g->failure_label = label;
     str_clear(g->failure_str);
     wsetlab_begin(g, g->failure_label);
     generate(g, p->left);
@@ -582,12 +586,13 @@ static void generate_GO(struct generator * g, struct node * p, int style) {
         end_unreachable = true;
     } else {
         /* include for goto; omit for gopast */
-        if (style == 1) write_restorecursor(g, p, savevar);
+        if (is_goto) write_restorecursor(g, p, savevar);
         g->I[0] = golab;
         w(g, "~Mbreak golab~I0~N");
+        g->unreachable = true;
     }
+    wsetlab_end(g, g->failure_label);
     g->unreachable = false;
-    w(g, "~-~M}~N");
     if (savevar) {
         write_restorecursor(g, p, savevar);
         str_delete(savevar);
@@ -604,11 +609,11 @@ static void generate_GO(struct generator * g, struct node * p, int style) {
 }
 
 static void generate_loop(struct generator * g, struct node * p) {
-    struct str * loopvar = vars_newname(g);
     write_comment(g, p);
-    w(g, "~Mfor _ = range make([]struct{},");
+    struct str * loopvar = vars_newname(g);
+    w(g, "~Mfor _ = range make([]struct{}, ");
     generate_AE(g, p->AE);
-    writef(g, ") {~+", p);
+    writef(g, ") {~N~+", p);
 
     generate(g, p->left);
 
@@ -620,18 +625,19 @@ static void generate_loop(struct generator * g, struct node * p) {
 static void generate_repeat_or_atleast(struct generator * g, struct node * p, struct str * loopvar) {
     int replab = new_label(g);
     g->I[0] = replab;
-    writef(g, "~Mreplab~I0: for{~N~+", p);
+    writef(g, "~-~Mreplab~I0:~N~+~Mfor {~N~+", p);
 
     struct str * savevar = NULL;
-    if (repeat_restore(g, p->left)) {
+    if (repeat_restore(p->left)) {
         savevar = vars_newname(g);
         write_savecursor(g, p, savevar);
     }
 
-    g->failure_label = new_label(g);
+    int label = new_label(g);
+    g->failure_label = label;
     str_clear(g->failure_str);
     g->I[0] = g->failure_label;
-    w(g, "~Mlab~I0: for _ = range [2]struct{}{} {~N~+");
+    w(g, "~-~Mlab~I0:~N~+~Mfor range [2]struct{}{} {~N~+");
     generate(g, p->left);
 
     if (!g->unreachable) {
@@ -661,9 +667,9 @@ static void generate_repeat(struct generator * g, struct node * p) {
 }
 
 static void generate_atleast(struct generator * g, struct node * p) {
-    struct str * loopvar = vars_newname(g);
-
     write_comment(g, p);
+
+    struct str * loopvar = vars_newname(g);
     g->B[0] = str_data(loopvar);
     w(g, "~Mvar ~B0 = ");
     generate_AE(g, p->AE);
@@ -683,12 +689,6 @@ static void generate_atleast(struct generator * g, struct node * p) {
     str_delete(loopvar);
 }
 
-static void generate_setmark(struct generator * g, struct node * p) {
-    write_comment(g, p);
-    g->V[0] = p->name;
-    writef(g, "~M~V0 = env.Cursor~N", p);
-}
-
 static void generate_tomark(struct generator * g, struct node * p) {
     write_comment(g, p);
     g->S[0] = p->mode == m_forward ? ">" : "<";
@@ -701,15 +701,6 @@ static void generate_tomark(struct generator * g, struct node * p) {
     w(g, "~Menv.Cursor = "); generate_AE(g, p->AE); writef(g, "~N", p);
 }
 
-static void generate_atmark(struct generator * g, struct node * p) {
-    write_comment(g, p);
-    w(g, "~Mif env.Cursor != "); generate_AE(g, p->AE); writef(g, " ", p);
-    write_block_start(g);
-    write_failure(g);
-    write_block_end(g);
-    g->unreachable = false;
-}
-
 static void generate_hop(struct generator * g, struct node * p) {
     write_comment(g, p);
     // Generate the AE to a temporary block so we can substitute it in
@@ -726,26 +717,12 @@ static void generate_hop(struct generator * g, struct node * p) {
     str_delete(ae);
 }
 
-static void generate_delete(struct generator * g, struct node * p) {
-    write_comment(g, p);
-    writef(g, "~Mif !env.SliceDel() {~N"
-              "~+~Mreturn false~N~-"
-              "~M}~N", p);
-}
-
 static void generate_tolimit(struct generator * g, struct node * p) {
     write_comment(g, p);
     g->S[0] = p->mode == m_forward ? "env.Limit" : "env.LimitBackward";
     writef(g, "~Menv.Cursor = ~S0~N", p);
 }
 
-static void generate_atlimit(struct generator * g, struct node * p) {
-    write_comment(g, p);
-    g->S[0] = p->mode == m_forward ? "env.Limit" : "env.LimitBackward";
-    g->S[1] = p->mode == m_forward ? "<" : ">";
-    write_failure_if(g, "env.Cursor ~S1 ~S0", p);
-}
-
 static void generate_leftslice(struct generator * g, struct node * p) {
     write_comment(g, p);
     g->S[0] = p->mode == m_forward ? "env.Bra" : "env.Ket";
@@ -760,16 +737,12 @@ static void generate_rightslice(struct generator * g, struct node * p) {
 
 static void generate_assignto(struct generator * g, struct node * p) {
     write_comment(g, p);
-    g->V[0] = p->name;
-    writef(g, "~M~V0 = env.AssignTo()~N", p);
+    writef(g, "~M~V = env.AssignTo()~N", p);
 }
 
 static void generate_sliceto(struct generator * g, struct node * p) {
     write_comment(g, p);
-    g->V[0] = p->name;
-    writef(g, "~M~V0 = env.SliceTo()~N"
-              "~Mif ~V0 == \"\" {~N"
-              "~+~Mreturn false~N~-~M}~N", p);
+    writef(g, "~M~V = env.SliceTo()~N", p);
 }
 
 static void generate_address(struct generator * g, struct node * p) {
@@ -782,26 +755,28 @@ static void generate_address(struct generator * g, struct node * p) {
 }
 
 static void generate_insert(struct generator * g, struct node * p, int style) {
-    int keep_c = style == c_attach;
-
+    write_margin(g);
     write_block_start(g);
     write_comment(g, p);
+    int keep_c = style == c_attach;
     if (p->mode == m_backward) keep_c = !keep_c;
     if (keep_c) w(g, "~Mvar c = env.Cursor~N");
     w(g, "~Mbra, ket := env.Cursor, env.Cursor~N");
     writef(g, "~Menv.Insert(bra, ket, ", p);
     generate_address(g, p);
-    writef(g, ");~N", p);
+    writef(g, ")~N", p);
     if (keep_c) w(g, "~Menv.Cursor = c~N");
     write_block_end(g);
 }
 
-static void generate_assignfrom(struct generator * g, struct node * p) {
-    int keep_c = p->mode == m_forward; /* like 'attach' */
-
+static void generate_stringassign(struct generator * g, struct node * p) {
+    write_margin(g);
     write_block_start(g);
     write_comment(g, p);
-    if (keep_c) writef(g, "~Mvar c = env.Cursor~N", p);
+    int keep_c = p->mode == m_forward; /* like 'attach' */
+    if (keep_c) {
+        writef(g, "~Mvar c = env.Cursor~N", p);
+    }
     if (p->mode == m_forward) {
         writef(g, "~Menv.Insert(env.Cursor, env.Limit, ", p);
     } else {
@@ -809,21 +784,27 @@ static void generate_assignfrom(struct generator * g, struct node * p) {
     }
     generate_address(g, p);
     writef(g, ")~N", p);
-    if (keep_c) w(g, "~Menv.Cursor = c~N");
+    if (keep_c) {
+        w(g, "~Menv.Cursor = c~N");
+    }
     write_block_end(g);
 }
 
 static void generate_slicefrom(struct generator * g, struct node * p) {
     write_comment(g, p);
-    w(g, "~Mif !env.SliceFrom(");
+    if (p->literalstring && SIZE(p->literalstring) == 0) {
+        w(g, "~Menv.SliceDel()~N");
+        return;
+    }
+    w(g, "~Menv.SliceFrom(");
     generate_address(g, p);
-    writef(g, ") {~N"
-              "~+~Mreturn false~N~-~M}~N", p);
+    w(g, ")~N");
 }
 
 static void generate_setlimit(struct generator * g, struct node * p) {
-    struct str * varname = vars_newname(g);
     write_comment(g, p);
+    struct str * varname = vars_newname(g);
+
     if (p->left && p->left->type == c_tomark) {
         /* Special case for:
          *
@@ -835,6 +816,7 @@ static void generate_setlimit(struct generator * g, struct node * p) {
          */
         struct node * q = p->left;
         write_comment(g, q);
+
         g->S[0] = q->mode == m_forward ? ">" : "<";
         w(g, "~Mif env.Cursor ~S0 "); generate_AE(g, q->AE); w(g, " ");
         write_block_start(g);
@@ -844,22 +826,24 @@ static void generate_setlimit(struct generator * g, struct node * p) {
 
         g->B[0] = str_data(varname);
         if (p->mode == m_forward) {
-            w(g, "~Mvar ~B0 = env.Limit - env.Cursor~N");
+            w(g, "~Mvar ~B0 = env.Limit~N");
             w(g, "~Menv.Limit = ");
+            generate_AE(g, q->AE);
+            w(g, "~N");
+            w(g, "~M~B0 -= env.Limit~N");
         } else {
             w(g, "~Mvar ~B0 = env.LimitBackward~N");
             w(g, "~Menv.LimitBackward = ");
+            generate_AE(g, q->AE);
+            w(g, "~N");
         }
-        generate_AE(g, q->AE); writef(g, ";~N", q);
 
         if (p->mode == m_forward) {
             str_assign(g->failure_str, "env.Limit += ");
             str_append(g->failure_str, varname);
-            str_append_string(g->failure_str, ";");
         } else {
             str_assign(g->failure_str, "env.LimitBackward = ");
             str_append(g->failure_str, varname);
-            str_append_string(g->failure_str, ";");
         }
     } else {
         struct str * savevar = vars_newname(g);
@@ -881,11 +865,9 @@ static void generate_setlimit(struct generator * g, struct node * p) {
             if (p->mode == m_forward) {
                 str_assign(g->failure_str, "env.Limit += ");
                 str_append(g->failure_str, varname);
-                str_append_string(g->failure_str, ";");
             } else {
                 str_assign(g->failure_str, "env.LimitBackward = ");
                 str_append(g->failure_str, varname);
-                str_append_string(g->failure_str, ";");
             }
         }
         str_delete(savevar);
@@ -908,28 +890,56 @@ static void generate_setlimit(struct generator * g, struct node * p) {
 static void generate_dollar(struct generator * g, struct node * p) {
     write_comment(g, p);
 
+    int a0 = g->failure_label;
+    struct str * a1 = str_copy(g->failure_str);
+    int label = new_label(g);
+    g->failure_label = label;
+    str_clear(g->failure_str);
+
     struct str * savevar = vars_newname(g);
-    g->V[0] = p->name;
     g->B[0] = str_data(savevar);
     writef(g, "~Mvar ~B0 = env.Clone()~N"
-              "~Menv.SetCurrent(~V0)~N", p);
+              "~Menv.SetCurrent(~V)~N", p);
+    if (p->left->possible_signals == -1) {
+        /* Assume failure. */
+        w(g, "~Mvar ~B0_f = true~N");
+    }
+
+    wsetlab_begin(g, g->failure_label);
+
     generate(g, p->left);
-    if (!g->unreachable) {
-        g->V[0] = p->name;
+
+    if (!g->unreachable && p->left->possible_signals == -1) {
+        /* Mark success. */
         g->B[0] = str_data(savevar);
-        /* Update string variable. */
-        w(g, "~M~V0 = env.Current()~N");
-        /* Reset env */
-        w(g, "~M*env = *~B0~N");
+        w(g, "~M~B0_f = false~N");
     }
+
+    wsetlab_end(g, g->failure_label);
+
+    g->failure_label = a0;
+    str_delete(g->failure_str);
+    g->failure_str = a1;
+
+    g->B[0] = str_data(savevar);
+    /* Update string variable; restore env. */
+    writef(g, "~M~V = env.Current()~N"
+              "~M*env = *~B0~N", p);
+
+    if (p->left->possible_signals == 0) {
+        // p->left always signals f.
+        write_failure(g);
+    } else if (p->left->possible_signals == -1) {
+        write_failure_if(g, "~B0_f", p);
+    }
+
     str_delete(savevar);
 }
 
 static void generate_integer_assign(struct generator * g, struct node * p, const char * s) {
     write_comment(g, p);
-    g->V[0] = p->name;
     g->S[0] = s;
-    w(g, "~M~V0 ~S0 ");
+    writef(g, "~M~V ~S0 ", p);
     generate_AE(g, p->AE);
     w(g, "~N");
 }
@@ -937,7 +947,7 @@ static void generate_integer_assign(struct generator * g, struct node * p, const
 static void generate_integer_test(struct generator * g, struct node * p) {
     write_comment(g, p);
     int relop = p->type;
-    int optimise_to_return = (g->failure_label == x_return && p->right && p->right->type == c_functionend);
+    int optimise_to_return = tailcallable(g, p);
     if (optimise_to_return) {
         w(g, "~Mreturn ");
         p->right = NULL;
@@ -947,12 +957,12 @@ static void generate_integer_test(struct generator * g, struct node * p) {
         relop ^= 1;
     }
     generate_AE(g, p->left);
-    // Relational operators are the same as C.
-    write_c_relop(g, relop);
+    write_relop(g, relop);
     generate_AE(g, p->AE);
     if (optimise_to_return) {
         w(g, "~N");
     } else {
+        write_char(g, ' ');
         write_block_start(g);
         write_failure(g);
         write_block_end(g);
@@ -961,24 +971,28 @@ static void generate_integer_test(struct generator * g, struct node * p) {
 }
 
 static void generate_call(struct generator * g, struct node * p) {
-    int signals = check_possible_signals_list(g, p->name->definition, c_define, 0);
+    int signals = p->name->definition->possible_signals;
     write_comment(g, p);
-    g->V[0] = p->name;
-    if (g->failure_label == x_return &&
-        (signals == 0 || (p->right && p->right->type == c_functionend))) {
-        /* Always fails or tail call. */
-        writef(g, "~Mreturn ~W0(env, context)~N", p);
+    if (tailcallable(g, p)) {
+        /* Tail call. */
+        writef(g, "~Mreturn ~W(env, context)~N", p);
+        p->right = NULL;
+        return;
+    }
+    if (just_return_on_fail(g) && signals == 0) {
+        /* Always fails. */
+        writef(g, "~Mreturn ~W(env, context)~N", p);
         return;
     }
     if (signals == 1) {
         /* Always succeeds. */
-        writef(g, "~M~W0(env, context)~N", p);
+        writef(g, "~M~W(env, context)~N", p);
     } else if (signals == 0) {
         /* Always fails. */
-        writef(g, "~M~W0(env, context)~N", p);
+        writef(g, "~M~W(env, context)~N", p);
         write_failure(g);
     } else {
-        write_failure_if(g, "!~W0(env, context)", p);
+        write_failure_if(g, "!~W(env, context)", p);
     }
 }
 
@@ -988,40 +1002,63 @@ static void generate_grouping(struct generator * g, struct node * p, int complem
     struct grouping * q = p->name->grouping;
     g->S[0] = p->mode == m_forward ? "" : "B";
     g->S[1] = complement ? "Out" : "In";
-    g->V[0] = p->name;
     g->I[0] = q->smallest_ch;
     g->I[1] = q->largest_ch;
-    write_failure_if(g, "!env.~S1Grouping~S0(~W0, ~I0, ~I1)", p);
+    if (tailcallable(g, p)) {
+        writef(g, "~Mreturn env.~S1Grouping~S0(~W, ~I0, ~I1);~N", p);
+        p->right = NULL;
+    } else {
+        write_failure_if(g, "!env.~S1Grouping~S0(~W, ~I0, ~I1)", p);
+    }
 }
 
 static void generate_namedstring(struct generator * g, struct node * p) {
     write_comment(g, p);
     g->S[0] = p->mode == m_forward ? "" : "B";
-    g->V[0] = p->name;
-    write_failure_if(g, "!env.EqS~S0(~V0)", p);
+    if (tailcallable(g, p)) {
+        writef(g, "~Mreturn env.EqS~S0(~V)~N", p);
+        p->right = NULL;
+    } else {
+        write_failure_if(g, "!env.EqS~S0(~V)", p);
+    }
 }
 
 static void generate_literalstring(struct generator * g, struct node * p) {
-    symbol * b = p->literalstring;
     write_comment(g, p);
     g->S[0] = p->mode == m_forward ? "" : "B";
-    g->L[0] = b;
-    write_failure_if(g, "!env.EqS~S0(~L0)", p);
+    if (tailcallable(g, p)) {
+        writef(g, "~Mreturn env.EqS~S0(~L)~N", p);
+        p->right = NULL;
+    } else {
+        write_failure_if(g, "!env.EqS~S0(~L)", p);
+    }
 }
 
 static void generate_setup_context(struct generator * g) {
-    w(g, "~Mvar context =  &Context {~+~N");
+    if (g->analyser->variable_count == 0) {
+        w(g, "~Mvar context = &Context{}~N");
+        w(g, "~M_ = context~N");
+        return;
+    }
+
+    w(g, "~Mvar context = &Context{~+~N");
     for (struct name * q = g->analyser->names; q; q = q->next) {
-        g->V[0] = q;
+        if (q->local_to) continue;
         switch (q->type) {
             case t_string:
-                w(g, "~M~W0: \"\",~N");
+                write_margin(g);
+                write_varname(g, q);
+                w(g, ": \"\",~N");
                 break;
             case t_integer:
-                w(g, "~M~W0: 0,~N");
+                write_margin(g);
+                write_varname(g, q);
+                w(g, ": 0,~N");
                 break;
             case t_boolean:
-                w(g, "~M~W0: false,~N");
+                write_margin(g);
+                write_varname(g, q);
+                w(g, ": false,~N");
                 break;
         }
     }
@@ -1030,27 +1067,55 @@ static void generate_setup_context(struct generator * g) {
 }
 
 static void generate_define(struct generator * g, struct node * p) {
-    struct name * q = p->name;
-    if (q->type == t_routine && !q->used) return;
-
     write_newline(g);
     write_comment(g, p);
 
-    g->V[0] = q;
-
+    struct name * q = p->name;
     if (q->type == t_routine) {
-        w(g, "~Mfunc ~W0(env *snowballRuntime.Env, ctx interface{}) bool {~+~N");
+        writef(g, "~Mfunc ~W(env *snowballRuntime.Env, ctx interface{}) bool {~+~N", p);
         w(g, "~Mcontext := ctx.(*Context)~N");
         w(g, "~M_ = context~N");
     } else {
-        w(g, "~Mfunc ~W0(env *snowballRuntime.Env) bool {~+~N");
+        writef(g, "~Mfunc ~E(env *snowballRuntime.Env) bool {~+~N", p);
         generate_setup_context(g);
+        if (q->used != q->definition) {
+            // This external needs to be callable as a routine, so generate
+            // the actual code like a routine with an external which just
+            // forwards to that.
+            writef(g, "~Mreturn ~W(env, context)~N", p);
+            w(g, "~-~M}~N");
+            writef(g, "~Mfunc ~W(env *snowballRuntime.Env, ctx interface{}) bool {~+~N", p);
+            w(g, "~Mcontext := ctx.(*Context)~N");
+            w(g, "~M_ = context~N");
+        }
     }
-    if (p->amongvar_needed) w(g, "~Mvar among_var int32~N");
 
-    /* Save output. */
-    struct str * saved_output = g->outbuf;
-    g->outbuf = str_new();
+    if (q->amongvar_needed) {
+        w(g, "~Mvar among_var int32~N");
+    }
+
+    /* Declare localised variables. */
+    for (struct name * name = g->analyser->names; name; name = name->next) {
+        if (name->local_to == q) {
+            switch (name->type) {
+                case t_string:
+                    w(g, "~Mvar ");
+                    write_varname(g, name);
+                    w(g, " string~N");
+                    break;
+                case t_integer:
+                    w(g, "~Mvar ");
+                    write_varname(g, name);
+                    w(g, " int~N");
+                    break;
+                case t_boolean:
+                    w(g, "~Mvar ");
+                    write_varname(g, name);
+                    w(g, " bool~N");
+                    break;
+            }
+        }
+    }
 
     g->next_label = 0;
     g->var_number = 0;
@@ -1058,21 +1123,16 @@ static void generate_define(struct generator * g, struct node * p) {
     str_clear(g->failure_str);
     g->failure_label = x_return;
     g->unreachable = false;
-    int signals = check_possible_signals_list(g, p->left, c_define, 0);
 
     /* Generate function body. */
     generate(g, p->left);
     if (p->left->right) {
         assert(p->left->right->type == c_functionend);
-        if (signals) {
+        if (p->left->possible_signals) {
             generate(g, p->left->right);
         }
     }
     w(g, "~-~M}~N");
-
-    str_append(saved_output, g->outbuf);
-    str_delete(g->outbuf);
-    g->outbuf = saved_output;
 }
 
 static void generate_functionend(struct generator * g, struct node * p) {
@@ -1095,6 +1155,10 @@ static void generate_substring(struct generator * g, struct node * p) {
         }
     } else if (x->always_matches) {
         writef(g, "~Menv.FindAmong~S0(A_~I0, context)~N", p);
+    } else if (x->command_count == 0 && tailcallable(g, p)) {
+        writef(g, "~Mreturn env.FindAmong~S0(A_~I0, context) != 0~N", p);
+        x->node->right = NULL;
+        g->unreachable = true;
     } else {
         write_failure_if(g, "env.FindAmong~S0(A_~I0, context) == 0", p);
     }
@@ -1125,10 +1189,23 @@ static void generate_among(struct generator * g, struct node * p) {
     }
 }
 
-static void generate_booltest(struct generator * g, struct node * p) {
+static void generate_booltest(struct generator * g, struct node * p, int inverted) {
     write_comment(g, p);
-    g->V[0] = p->name;
-    write_failure_if(g, "!~V0", p);
+    if (tailcallable(g, p)) {
+        // Optimise at end of function.
+        if (inverted) {
+            writef(g, "~Mreturn !~V~N", p);
+        } else {
+            writef(g, "~Mreturn ~V~N", p);
+        }
+        p->right = NULL;
+        return;
+    }
+    if (inverted) {
+        write_failure_if(g, "~V", p);
+    } else {
+        write_failure_if(g, "!~V", p);
+    }
 }
 
 static void generate_false(struct generator * g, struct node * p) {
@@ -1173,25 +1250,21 @@ static void generate(struct generator * g, struct node * p) {
         case c_repeat:        generate_repeat(g, p); break;
         case c_loop:          generate_loop(g, p); break;
         case c_atleast:       generate_atleast(g, p); break;
-        case c_setmark:       generate_setmark(g, p); break;
         case c_tomark:        generate_tomark(g, p); break;
-        case c_atmark:        generate_atmark(g, p); break;
         case c_hop:           generate_hop(g, p); break;
-        case c_delete:        generate_delete(g, p); break;
         case c_next:          generate_next(g, p); break;
         case c_tolimit:       generate_tolimit(g, p); break;
-        case c_atlimit:       generate_atlimit(g, p); break;
         case c_leftslice:     generate_leftslice(g, p); break;
         case c_rightslice:    generate_rightslice(g, p); break;
         case c_assignto:      generate_assignto(g, p); break;
         case c_sliceto:       generate_sliceto(g, p); break;
-        case c_assign:        generate_assignfrom(g, p); break;
+        case c_stringassign:  generate_stringassign(g, p); break;
         case c_insert:
         case c_attach:        generate_insert(g, p, p->type); break;
         case c_slicefrom:     generate_slicefrom(g, p); break;
         case c_setlimit:      generate_setlimit(g, p); break;
         case c_dollar:        generate_dollar(g, p); break;
-        case c_mathassign:    generate_integer_assign(g, p, "="); break;
+        case c_assign:        generate_integer_assign(g, p, "="); break;
         case c_plusassign:    generate_integer_assign(g, p, "+="); break;
         case c_minusassign:   generate_integer_assign(g, p, "-="); break;
         case c_multiplyassign:generate_integer_assign(g, p, "*="); break;
@@ -1211,7 +1284,8 @@ static void generate(struct generator * g, struct node * p) {
         case c_literalstring: generate_literalstring(g, p); break;
         case c_among:         generate_among(g, p); break;
         case c_substring:     generate_substring(g, p); break;
-        case c_booltest:      generate_booltest(g, p); break;
+        case c_booltest:      generate_booltest(g, p, false); break;
+        case c_not_booltest:  generate_booltest(g, p, true); break;
         case c_false:         generate_false(g, p); break;
         case c_true:          break;
         case c_debug:         generate_debug(g, p); break;
@@ -1227,13 +1301,13 @@ static void generate(struct generator * g, struct node * p) {
 
 static void generate_class_begin(struct generator * g) {
     w(g, "package ");
-    w(g, g->options->package);
+    write_string(g, g->options->package);
     w(g, "~N~N");
 
-    w(g, "import(~N");
-    w(g, "  snowballRuntime \"");
-    w(g, g->options->go_snowball_runtime);
-    w(g, "\"~N)~N~N");
+    w(g, "import (~N");
+    w(g, "~+~MsnowballRuntime \"");
+    write_string(g, g->options->go_snowball_runtime);
+    w(g, "\"~N~-)~N~N");
 }
 
 static void generate_among_table(struct generator * g, struct among * x) {
@@ -1247,17 +1321,17 @@ static void generate_among_table(struct generator * g, struct among * x) {
     for (int i = 0; i < x->literalstring_count; i++) {
         g->I[0] = v[i].i;
         g->I[1] = v[i].result;
-        g->L[0] = v[i].b;
-        g->S[0] = ",";
 
-        w(g, "~M&snowballRuntime.Among{Str:~L0, A:~I0, B:~I1, ");
+        w(g, "~M&snowballRuntime.Among{Str: ");
+        write_literal_string(g, v[i].b);
+        w(g, ", A: ~I0, B: ~I1, F: ");
+
         if (v[i].function != NULL) {
-            w(g, "F:");
             write_varname(g, v[i].function);
         } else {
-            w(g, "F:nil");
+            w(g, "nil");
         }
-        w(g, "}~S0~N");
+        w(g, "},~N");
     }
     w(g, "~-~M}~N~N");
 }
@@ -1268,11 +1342,11 @@ static void generate_amongs(struct generator * g) {
     }
 }
 
-static void set_bit(symbol * b, int i) { b[i/8] |= 1 << i%8; }
+static void set_bit(symbol * b, int i) { b[i >> 3] |= 1 << (i & 7); }
 
 static void generate_grouping_table(struct generator * g, struct grouping * q) {
     int range = q->largest_ch - q->smallest_ch + 1;
-    int size = (range + 7)/ 8;  /* assume 8 bits per symbol */
+    int size = (range + 7) / 8;  /* assume 8 bits per symbol */
     symbol * b = q->b;
     symbol * map = create_b(size);
 
@@ -1280,11 +1354,12 @@ static void generate_grouping_table(struct generator * g, struct grouping * q) {
 
     for (int i = 0; i < SIZE(b); i++) set_bit(map, b[i] - q->smallest_ch);
 
-    g->V[0] = q->name;
-    w(g, "~Mvar ~W0 = []byte{");
+    w(g, "~Mvar ");
+    write_varname(g, q->name);
+    w(g, " = []byte{");
     for (int i = 0; i < size; i++) {
+        if (i) w(g, ", ");
         write_int(g, map[i]);
-        if (i < size - 1) w(g, ", ");
     }
     w(g, "}~N~N");
 
@@ -1293,24 +1368,29 @@ static void generate_grouping_table(struct generator * g, struct grouping * q) {
 
 static void generate_groupings(struct generator * g) {
     for (struct grouping * q = g->analyser->groupings; q; q = q->next) {
-        if (q->name->used)
-            generate_grouping_table(g, q);
+        generate_grouping_table(g, q);
     }
 }
 
 static void generate_members(struct generator * g) {
     w(g, "type Context struct {~+~N");
     for (struct name * q = g->analyser->names; q; q = q->next) {
-        g->V[0] = q;
+        if (q->local_to) continue;
         switch (q->type) {
             case t_string:
-                w(g, "~M~W0 string~N");
+                write_margin(g);
+                write_varname(g, q);
+                w(g, " string~N");
                 break;
             case t_integer:
-                w(g, "~M~W0 int~N");
+                write_margin(g);
+                write_varname(g, q);
+                w(g, " int~N");
                 break;
             case t_boolean:
-                w(g, "~M~W0 bool~N");
+                write_margin(g);
+                write_varname(g, q);
+                w(g, " bool~N");
                 break;
         }
     }
@@ -1325,14 +1405,12 @@ static void generate_methods(struct generator * g) {
 }
 
 extern void generate_program_go(struct generator * g) {
+    g->margin_indent = "\t";
+
     g->outbuf = str_new();
     g->failure_str = str_new();
 
     write_start_comment(g, "//! ", NULL);
-    if (g->analyser->int_limits_used) {
-        /* std::usize is used in the code generated for usize::MAX and usize::MIN */
-        w(g, "use std::usize;~N~N");
-    }
     generate_class_begin(g);
 
     generate_amongs(g);