speech-rule-engine
Version:
A standalone speech rule engine for XML structures, based on the original engine from ChromeVox.
160 lines (159 loc) • 6.03 kB
JavaScript
import * as DomUtil from '../common/dom_util.js';
import * as XpathUtil from '../common/xpath_util.js';
import { Grammar } from '../rule_engine/grammar.js';
import * as MathCompoundStore from '../rule_engine/math_compound_store.js';
import { AbstractTrieNode } from './abstract_trie_node.js';
import { StaticTrieNode } from './abstract_trie_node.js';
import { TrieNodeKind } from './trie_node.js';
export function getNode(kind, constraint, context) {
switch (kind) {
case TrieNodeKind.ROOT:
return new RootTrieNode();
case TrieNodeKind.DYNAMIC:
return new DynamicTrieNode(constraint);
case TrieNodeKind.QUERY:
return new QueryTrieNode(constraint, context);
case TrieNodeKind.BOOLEAN:
return new BooleanTrieNode(constraint, context);
default:
return null;
}
}
class RootTrieNode extends AbstractTrieNode {
constructor() {
super('', () => true);
this.kind = TrieNodeKind.ROOT;
}
}
class DynamicTrieNode extends AbstractTrieNode {
constructor(constraint) {
super(constraint, (axis) => axis === constraint);
this.kind = TrieNodeKind.DYNAMIC;
}
}
const comparator = {
'=': (x, y) => x === y,
'!=': (x, y) => x !== y,
'<': (x, y) => x < y,
'>': (x, y) => x > y,
'<=': (x, y) => x <= y,
'>=': (x, y) => x >= y
};
function constraintTest(constraint) {
if (constraint.match(/^self::\*$/)) {
return (_node) => true;
}
if (constraint.match(/^self::\w+$/)) {
const tag = constraint.slice(6).toUpperCase();
return (node) => node.tagName && DomUtil.tagName(node) === tag;
}
if (constraint.match(/^self::\w+:\w+$/)) {
const inter = constraint.split(':');
const namespace = XpathUtil.resolveNameSpace(inter[2]);
if (!namespace) {
return null;
}
const tag = inter[3].toUpperCase();
return (node) => node.localName &&
node.localName.toUpperCase() === tag &&
node.namespaceURI === namespace;
}
if (constraint.match(/^@\w+$/)) {
const attr = constraint.slice(1);
return (node) => node.hasAttribute && node.hasAttribute(attr);
}
if (constraint.match(/^@\w+="[\w\d ]+"$/)) {
const split = constraint.split('=');
const attr = split[0].slice(1);
const value = split[1].slice(1, -1);
return (node) => node.hasAttribute &&
node.hasAttribute(attr) &&
node.getAttribute(attr) === value;
}
if (constraint.match(/^@\w+!="[\w\d ]+"$/)) {
const split = constraint.split('!=');
const attr = split[0].slice(1);
const value = split[1].slice(1, -1);
return (node) => !node.hasAttribute ||
!node.hasAttribute(attr) ||
node.getAttribute(attr) !== value;
}
if (constraint.match(/^contains\(\s*@grammar\s*,\s*"[\w\d ]+"\s*\)$/)) {
const split = constraint.split('"');
const value = split[1];
return (_node) => !!Grammar.getInstance().getParameter(value);
}
if (constraint.match(/^not\(\s*contains\(\s*@grammar\s*,\s*"[\w\d ]+"\s*\)\s*\)$/)) {
const split = constraint.split('"');
const value = split[1];
return (_node) => !Grammar.getInstance().getParameter(value);
}
if (constraint.match(/^name\(\.\.\/\.\.\)="\w+"$/)) {
const split = constraint.split('"');
const tag = split[1].toUpperCase();
return (node) => {
var _a, _b;
return ((_b = (_a = node.parentNode) === null || _a === void 0 ? void 0 : _a.parentNode) === null || _b === void 0 ? void 0 : _b.tagName) &&
DomUtil.tagName(node.parentNode.parentNode) === tag;
};
}
if (constraint.match(/^count\(preceding-sibling::\*\)=\d+$/)) {
const split = constraint.split('=');
const num = parseInt(split[1], 10);
return (node) => { var _a; return ((_a = node.parentNode) === null || _a === void 0 ? void 0 : _a.childNodes[num]) === node; };
}
if (constraint.match(/^.+\[@category!?=".+"\]$/)) {
let [, query, equality, category] = constraint.match(/^(.+)\[@category(!?=)"(.+)"\]$/);
const unit = category.match(/^unit:(.+)$/);
let add = '';
if (unit) {
category = unit[1];
add = ':unit';
}
return (node) => {
const xpath = XpathUtil.evalXPath(query, node)[0];
if (xpath) {
const result = MathCompoundStore.lookupCategory(xpath.textContent + add);
return equality === '=' ? result === category : result !== category;
}
return false;
};
}
if (constraint.match(/^string-length\(.+\)\W+\d+/)) {
const [, select, comp, count] = constraint.match(/^string-length\((.+)\)(\W+)(\d+)/);
const func = comparator[comp] || comparator['='];
const numb = parseInt(count, 10);
return (node) => {
const xpath = XpathUtil.evalXPath(select, node)[0];
if (!xpath) {
return false;
}
return func(Array.from(xpath.textContent).length, numb);
};
}
return null;
}
class QueryTrieNode extends StaticTrieNode {
constructor(constraint, context) {
super(constraint, constraintTest(constraint));
this.context = context;
this.kind = TrieNodeKind.QUERY;
}
applyTest(object) {
return this.test
? this.test(object)
: this.context.applyQuery(object, this.constraint) === object;
}
}
class BooleanTrieNode extends StaticTrieNode {
constructor(constraint, context) {
super(constraint, constraintTest(constraint));
this.context = context;
this.kind = TrieNodeKind.BOOLEAN;
}
applyTest(object) {
return this.test
? this.test(object)
: this.context.applyConstraint(object, this.constraint);
}
}