You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
73 lines
1.7 KiB
JavaScript
73 lines
1.7 KiB
JavaScript
(function() {
|
|
|
|
module("PEG.compiler.checks");
|
|
|
|
test("reports missing referenced rules", function() {
|
|
function testGrammar(grammar) {
|
|
raises(
|
|
function() {
|
|
var ast = PEG.parser.parse(grammar);
|
|
PEG.compiler.checks.reportMissingRules(ast);
|
|
},
|
|
function(e) {
|
|
return e instanceof PEG.GrammarError
|
|
&& e.message === "Referenced rule \"missing\" does not exist.";
|
|
}
|
|
);
|
|
}
|
|
|
|
var grammars = [
|
|
'start = missing',
|
|
'start = missing / "a" / "b"',
|
|
'start = "a" / "b" / missing',
|
|
'start = missing "a" "b"',
|
|
'start = "a" "b" missing',
|
|
'start = label:missing',
|
|
'start = &missing',
|
|
'start = !missing',
|
|
'start = missing?',
|
|
'start = missing*',
|
|
'start = missing+',
|
|
'start = missing { }'
|
|
];
|
|
|
|
for (var i = 0; i < grammars.length; i++) { testGrammar(grammars[i]); }
|
|
});
|
|
|
|
test("reports left recursion", function() {
|
|
function testGrammar(grammar) {
|
|
raises(
|
|
function() {
|
|
var ast = PEG.parser.parse(grammar);
|
|
PEG.compiler.checks.reportLeftRecursion(ast);
|
|
},
|
|
function(e) {
|
|
return e instanceof PEG.GrammarError
|
|
&& e.message === "Left recursion detected for rule \"start\".";
|
|
}
|
|
);
|
|
}
|
|
|
|
var grammars = [
|
|
/* Direct */
|
|
'start = start',
|
|
'start = start / "a" / "b"',
|
|
'start = "a" / "b" / start',
|
|
'start = start "a" "b"',
|
|
'start = label:start',
|
|
'start = &start',
|
|
'start = !start',
|
|
'start = start?',
|
|
'start = start*',
|
|
'start = start+',
|
|
'start = start { }',
|
|
|
|
/* Indirect */
|
|
'start = stop; stop = start'
|
|
];
|
|
|
|
for (var i = 0; i < grammars.length; i++) { testGrammar(grammars[i]); }
|
|
});
|
|
|
|
})();
|