@sormy/lemon-js 1.0.1

package/lexer/lexer.js

@@ -0,0 +1,82 @@
+/**
+ * Primitive Lexer.
+ *
+ * This is single-state primitive lexer which will try to test each added rule
+ * one by one. First matched rule will be used to get token text.
+ *
+ * It could be used only for primitive grammars but also could be a good starting
+ * point for writing your own lexer. For longest match, start conditions and
+ * actions, see flex-js: https://github.com/sormy/flex-js
+ */
+function Lexer() {
+  this.index = 0;
+  this.rules = [];
+  this.input = '';
+}
+
+Lexer.prototype.addRule = function (expression, handler) {
+  if (typeof expression === 'string') {
+    expression = new RegExp(this.escapeRE(expression), 'y');
+  }
+  if (expression instanceof RegExp && !expression.sticky) {
+    expression = new RegExp(expression.source, expression.flags + 'y');
+  }
+  this.rules.push([ expression, handler ]);
+}
+
+Lexer.prototype.setInput = function (input) {
+  this.input = input;
+}
+
+Lexer.prototype.escapeRE = function (s) {
+  return s.replace(/[.*+?^${}()|[\]\\]/g, '\\$&');
+}
+
+Lexer.prototype.execRE = function (re) {
+  re.lastIndex = this.index;
+  var result = re.exec(this.input);
+  return result ? result[0] : undefined;
+}
+
+Lexer.prototype.raiseSyntaxError = function () {
+  throw new Error('Syntax error');
+}
+
+Lexer.prototype.lex = function () {
+  if (this.index >= this.input.length) {
+    return;
+  }
+
+  var token;
+  var matched;
+
+  do {
+    matched = false;
+
+    for (var index = 0; index < this.rules.length; index++) {
+      var rule = this.rules[index];
+
+      var expression = rule[0];
+      var handler = rule[1];
+
+      var value = this.execRE(expression);
+
+      // a rule matching nothing would leave the position where it was
+      if (value) {
+        token = handler(value);
+        matched = true;
+        this.index += value.length;
+        break;
+      }
+    }
+    // undefined token with match is a sign that we need to search next token
+  } while (matched && token === undefined && this.index < this.input.length);
+
+  if (!matched) {
+    this.raiseSyntaxError();
+  }
+
+  return token;
+}
+
+module.exports = Lexer;

package/package.json

@@ -0,0 +1,47 @@
+{
+  "name": "@sormy/lemon-js",
+  "version": "1.0.1",
+  "description": "LALR(1) parser generator for JavaScript, based on the lemon generator from SQLite",
+  "keywords": [
+    "lemon",
+    "lalr",
+    "parser",
+    "parser-generator",
+    "grammar",
+    "compiler"
+  ],
+  "homepage": "https://github.com/sormy/lemon-js#readme",
+  "bugs": "https://github.com/sormy/lemon-js/issues",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/sormy/lemon-js.git"
+  },
+  "license": "blessing",
+  "publishConfig": {
+    "access": "public"
+  },
+  "author": "Artem Butusov <art.sormy@gmail.com>",
+  "bin": {
+    "lemon-js": "bin/lemon-js.js"
+  },
+  "files": [
+    "bin/",
+    "dist/",
+    "lexer/lexer.js",
+    "examples/calculator-js.y",
+    "lempar.js",
+    "lemon-js.c",
+    "lemon.html",
+    "LICENSE"
+  ],
+  "scripts": {
+    "build": "./build-dist.sh",
+    "pretest": "gcc -o lemon-js -O2 lemon-js.c",
+    "test": "node --test test/*.test.js",
+    "test:dist": "LEMON_JS=bin/lemon-js.js node --test test/*.test.js",
+    "prepublishOnly": "npm run build && npm run test:dist"
+  },
+  "engines": {
+    "node": ">=12"
+  }
+}