pegjs/lib/compiler/passes/report-left-recursion.js
David Majda 0519d7e3ce Git repo npmization: Make the repo a npm package
Includes:

  * Moving the source code from /src to /lib.
  * Adding an explicit file list to package.json
  * Updating the Makefile.
  * Updating the spec and benchmark suites and their READMEs.

Part of a fix for GH-32.
2012-11-10 14:21:14 +01:00

64 lines
1.5 KiB
JavaScript

var utils = require("../../utils");
/* Checks that no left recursion is present. */
module.exports = function(ast) {
function nop() {}
function checkExpression(node, appliedRules) {
check(node.expression, appliedRules);
}
function checkSubnodes(propertyName) {
return function(node, appliedRules) {
utils.each(node[propertyName], function(subnode) {
check(subnode, appliedRules);
});
};
}
var check = utils.buildNodeVisitor({
grammar: checkSubnodes("rules"),
rule:
function(node, appliedRules) {
check(node.expression, appliedRules.concat(node.name));
},
named: checkExpression,
choice: checkSubnodes("alternatives"),
action: checkExpression,
sequence:
function(node, appliedRules) {
if (node.elements.length > 0) {
check(node.elements[0], appliedRules);
}
},
labeled: checkExpression,
simple_and: checkExpression,
simple_not: checkExpression,
semantic_and: nop,
semantic_not: nop,
optional: checkExpression,
zero_or_more: checkExpression,
one_or_more: checkExpression,
rule_ref:
function(node, appliedRules) {
if (utils.contains(appliedRules, node.name)) {
throw new PEG.GrammarError(
"Left recursion detected for rule \"" + node.name + "\"."
);
}
check(utils.findRuleByName(ast, node.name), appliedRules);
},
literal: nop,
"class": nop,
any: nop
});
check(ast, []);
};