This app provides monitoring and information features for the common freifunk user and the technical stuff of a freifunk community.
Code base is taken from a TUM Practical Course project and added here to see if Freifunk Altdorf can use it.
https://www.freifunk-altdorf.de
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
36 lines
1.0 KiB
36 lines
1.0 KiB
6 years ago
|
"use strict";
|
||
|
|
||
|
var GrammarError = require("../../grammar-error"),
|
||
|
asts = require("../asts"),
|
||
|
visitor = require("../visitor");
|
||
|
|
||
|
/*
|
||
|
* Reports expressions that don't consume any input inside |*| or |+| in the
|
||
|
* grammar, which prevents infinite loops in the generated parser.
|
||
|
*/
|
||
|
function reportInfiniteRepetition(ast) {
|
||
|
var check = visitor.build({
|
||
|
zero_or_more: function(node) {
|
||
|
if (!asts.alwaysConsumesOnSuccess(ast, node.expression)) {
|
||
|
throw new GrammarError(
|
||
|
"Possible infinite loop when parsing (repetition used with an expression that may not consume any input).",
|
||
|
node.location
|
||
|
);
|
||
|
}
|
||
|
},
|
||
|
|
||
|
one_or_more: function(node) {
|
||
|
if (!asts.alwaysConsumesOnSuccess(ast, node.expression)) {
|
||
|
throw new GrammarError(
|
||
|
"Possible infinite loop when parsing (repetition used with an expression that may not consume any input).",
|
||
|
node.location
|
||
|
);
|
||
|
}
|
||
|
}
|
||
|
});
|
||
|
|
||
|
check(ast);
|
||
|
}
|
||
|
|
||
|
module.exports = reportInfiniteRepetition;
|