73 lines
2.6 KiB
TypeScript
73 lines
2.6 KiB
TypeScript
|
import { TMGraph } from './TMGraph';
|
|||
|
|
|
|||
|
|
const typificationData = [
|
|||
|
|
['', ''],
|
|||
|
|
['X1', 'X1'],
|
|||
|
|
['Z', 'Z'],
|
|||
|
|
['R1', 'R1'],
|
|||
|
|
['C1', 'C1'],
|
|||
|
|
['C1×X1', 'C1 X1 C1×X1'],
|
|||
|
|
['X1×X1', 'X1 X1×X1'],
|
|||
|
|
['X1×X1×X1', 'X1 X1×X1×X1'],
|
|||
|
|
['ℬ(X1)', 'X1 ℬ(X1)'],
|
|||
|
|
['ℬℬ(X1)', 'X1 ℬ(X1) ℬℬ(X1)'],
|
|||
|
|
['ℬℬ(X1×X2)', 'X1 X2 X1×X2 ℬ(X1×X2) ℬℬ(X1×X2)'],
|
|||
|
|
['ℬ((X1×X1)×X2)', 'X1 X1×X1 X2 (X1×X1)×X2 ℬ((X1×X1)×X2)'],
|
|||
|
|
['ℬ(ℬ(X1)×ℬ(X1))', 'X1 ℬ(X1) ℬ(X1)×ℬ(X1) ℬ(ℬ(X1)×ℬ(X1))'],
|
|||
|
|
[
|
|||
|
|
'ℬ(ℬ((X1×ℬ(X1))×X1)×X2)',
|
|||
|
|
'X1 ℬ(X1) X1×ℬ(X1) (X1×ℬ(X1))×X1 ℬ((X1×ℬ(X1))×X1) X2 ℬ((X1×ℬ(X1))×X1)×X2 ℬ(ℬ((X1×ℬ(X1))×X1)×X2)'
|
|||
|
|
]
|
|||
|
|
];
|
|||
|
|
describe('Testing parsing typifications', () => {
|
|||
|
|
it.each(typificationData)('Typification parsing %p', (input: string, expected: string) => {
|
|||
|
|
const graph = new TMGraph();
|
|||
|
|
graph.addConstituenta('X1', input, []);
|
|||
|
|
const nodeText = graph.nodes.map(node => node.text).join(' ');
|
|||
|
|
expect(nodeText).toBe(expected);
|
|||
|
|
});
|
|||
|
|
});
|
|||
|
|
|
|||
|
|
describe('Testing constituents parsing', () => {
|
|||
|
|
test('simple expression no arguments', () => {
|
|||
|
|
const graph = new TMGraph();
|
|||
|
|
graph.addConstituenta('X1', 'ℬ(X1)', []);
|
|||
|
|
|
|||
|
|
expect(graph.nodes.length).toBe(2);
|
|||
|
|
expect(graph.nodes.at(-1)?.annotations).toStrictEqual(['X1']);
|
|||
|
|
});
|
|||
|
|
|
|||
|
|
test('no expression with single argument', () => {
|
|||
|
|
const graph = new TMGraph();
|
|||
|
|
graph.addConstituenta('X1', '', [{ alias: 'a', typification: 'X1' }]);
|
|||
|
|
const nodeText = graph.nodes.map(node => node.text).join(' ');
|
|||
|
|
|
|||
|
|
expect(nodeText).toBe('X1 ℬ(X1)');
|
|||
|
|
expect(graph.nodes.at(-1)?.annotations).toStrictEqual(['X1']);
|
|||
|
|
});
|
|||
|
|
|
|||
|
|
test('no expression with multiple arguments', () => {
|
|||
|
|
const graph = new TMGraph();
|
|||
|
|
graph.addConstituenta('X1', '', [
|
|||
|
|
{ alias: 'a', typification: 'X1' },
|
|||
|
|
{ alias: 'b', typification: 'R1×X1' }
|
|||
|
|
]);
|
|||
|
|
const nodeText = graph.nodes.map(node => node.text).join(' ');
|
|||
|
|
|
|||
|
|
expect(nodeText).toBe('X1 R1 R1×X1 X1×(R1×X1) ℬ(X1×(R1×X1))');
|
|||
|
|
expect(graph.nodes.at(-1)?.annotations).toStrictEqual(['X1']);
|
|||
|
|
});
|
|||
|
|
|
|||
|
|
test('expression with multiple arguments', () => {
|
|||
|
|
const graph = new TMGraph();
|
|||
|
|
graph.addConstituenta('X1', 'ℬ(X2×Z)', [
|
|||
|
|
{ alias: 'a', typification: 'X1' },
|
|||
|
|
{ alias: 'b', typification: 'R1×X1' }
|
|||
|
|
]);
|
|||
|
|
const nodeText = graph.nodes.map(node => node.text).join(' ');
|
|||
|
|
|
|||
|
|
expect(nodeText).toBe('X1 R1 R1×X1 X1×(R1×X1) X2 Z X2×Z ℬ(X2×Z) (X1×(R1×X1))×ℬ(X2×Z) ℬ((X1×(R1×X1))×ℬ(X2×Z))');
|
|||
|
|
expect(graph.nodes.at(-1)?.annotations).toStrictEqual(['X1']);
|
|||
|
|
});
|
|||
|
|
});
|