Merge pull request #161 from Thunno/fix-endings

Fix ending characters
Thunno · Aug 5, 2023 · d71c378 · d71c378
2 parents aac10a5 + f4bb050
commit d71c378
Show file tree

Hide file tree

Showing 3 changed files with 11 additions and 11 deletions.
diff --git a/src/__pycache__/test_run.cpython-39.pyc b/src/__pycache__/test_run.cpython-39.pyc
diff --git a/src/thunno2/__pycache__/lexer.cpython-39.pyc b/src/thunno2/__pycache__/lexer.cpython-39.pyc
diff --git a/src/thunno2/lexer.py b/src/thunno2/lexer.py
@@ -143,7 +143,7 @@ def tokenise(code, expected_end=""):
                 y = char + x
                 if y == "µµ":
                     i, r = tokenise(code[index + 1 :], expected_end=";")
-                    index += i
+                    index += i + 1
                     ret.append((y, "recursive environment", r))
                 elif y == "µ£":
                     ret.append((y, "print each", 0))
@@ -175,7 +175,7 @@ def tokenise(code, expected_end=""):
                     )
                 elif y == "µʋ":
                     i, r = tokenise(code[index + 1 :], expected_end=";")
-                    index += i
+                    index += i + 1
                     ret.append((y, "right reduce by", r))
                 elif y == "µ€":
                     index += 1
@@ -193,7 +193,7 @@ def tokenise(code, expected_end=""):
                     ret.append((y, "reverse stack", 0))
                 elif y == "µÑ":
                     i, r = tokenise(code[index + 1 :], expected_end=";")
-                    index += i
+                    index += i + 1
                     ret.append((y, "adjacent group by", r))
                 elif y == "µñ":
                     index += 1
@@ -571,35 +571,35 @@ def tokenise(code, expected_end=""):
             ret.append((char, "print without popping", 0))
         elif char == "ı":
             i, r = tokenise(code[index + 1 :], expected_end=";")
-            index += i
+            index += i + 1
             ret.append((char, "map", r))
         elif char == "æ":
             i, r = tokenise(code[index + 1 :], expected_end=";")
-            index += i
+            index += i + 1
             ret.append((char, "filter", r))
         elif char == "Þ":
             i, r = tokenise(code[index + 1 :], expected_end=";")
-            index += i
+            index += i + 1
             ret.append((char, "sort by", r))
         elif char == "Ñ":
             i, r = tokenise(code[index + 1 :], expected_end=";")
-            index += i
+            index += i + 1
             ret.append((char, "group by", r))
         elif char == "¥":
             i, r = tokenise(code[index + 1 :], expected_end=";")
-            index += i
+            index += i + 1
             ret.append((char, "fixed point", r))
         elif char == "Ƙ":
             i, r = tokenise(code[index + 1 :], expected_end=";")
             index += i
             ret.append((char, "first n integers", r))
         elif char == "Ʋ":
             i, r = tokenise(code[index + 1 :], expected_end=";")
-            index += i
+            index += i + 1
             ret.append((char, "cumulative reduce by", r))
         elif char == "{":
             i, r = tokenise(code[index + 1 :], expected_end="}")
-            index += i
+            index += i + 1
             ret.append((char, "for loop", r))
         elif char == "(":
             i, r1 = tokenise(code[index + 1 :], expected_end=";)")
@@ -614,7 +614,7 @@ def tokenise(code, expected_end=""):
             ret.append((char, "while loop", (r1, r2)))
         elif char == "⁽":
             i, r = tokenise(code[index + 1 :], expected_end="⁾")
-            index += i
+            index += i + 1
             ret.append((char, "forever loop", r))
         elif char == "?":
             i, r1 = tokenise(code[index + 1 :], expected_end=":;")