raj_mathe/logik2021
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

master > master: Teile auslagern + Vereinfachungen

Browse Source
This commit is contained in:
RD
2021-05-06 15:29:44 +02:00
parent d94d508e8c
commit 6f6de00296
4 changed files with 153 additions and 109 deletions
Download Patch File Download Diff File Expand all files Collapse all files

120
code/utests/u_rekursion.py
View File

@@ -8,7 +8,7 @@
import unittest;
from unittest import TestCase;
from aussagenlogik.schema import string_to_parts;
from aussagenlogik.schema import stringToSyntaxbaum;
from aussagenlogik.rekursion import rekursiv_atoms;
from aussagenlogik.rekursion import rekursiv_depth;
from aussagenlogik.rekursion import rekursiv_length;
@@ -21,6 +21,45 @@ from aussagenlogik.rekursion import rekursiv_eval;
#
# ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# TESTFALL eval(·, ·)
# ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# @unittest.skip('Methode noch nicht implementiert')
class TestRekursivEval(TestCase):
def test_literale(self):
fml = stringToSyntaxbaum('A0');
val = rekursiv_eval(fml, [ 'A0' ]);
assert val == 1;
fml = stringToSyntaxbaum('A0');
val = rekursiv_eval(fml, []);
assert val == 0;
fml = stringToSyntaxbaum('! A0');
val = rekursiv_eval(fml, [ 'A0' ]);
assert val == 0;
fml = stringToSyntaxbaum('! A0');
val = rekursiv_eval(fml, []);
assert val == 1;
def test_complex1(self):
fml = stringToSyntaxbaum('( ! A0 || (( A0 && A3 ) || A2 ))');
val = rekursiv_eval(fml, [ 'A0', 'A2' ]);
assert val == 1;
val = rekursiv_eval(fml, [ 'A0', 'A3' ]);
assert val == 1;
val = rekursiv_eval(fml, [ 'A0' ]);
assert val == 0;
val = rekursiv_eval(fml, [ 'A4', 'A8' ]);
assert val == 1;
def test_complex2(self):
fml = stringToSyntaxbaum('( ! A0 || (( A0 && A3 ) || ! A2 ))');
val = rekursiv_eval(fml, [ 'A0', 'A2' ]);
assert val == 0;
val = rekursiv_eval(fml, [ 'A0', 'A3' ]);
assert val == 1;
pass;
# ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# TESTFALL Atome(·)
# ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
@@ -28,22 +67,22 @@ from aussagenlogik.rekursion import rekursiv_eval;
@unittest.skip('Methode noch nicht implementiert')
class TestRekursivAtoms(TestCase):
def test_noduplicates(self):
fml = string_to_parts('( A4 && ( A4 || A4 ))');
fml = stringToSyntaxbaum('( A4 && ( A4 || A4 ))');
val = sorted(rekursiv_atoms(fml));
assert len([_ for _ in val if _ == 'A4']) == 1, 'Atome dürfen nicht mehrfach vorkommen!';
def test_nononatoms(self):
fml = string_to_parts('( {F} || A3 )');
fml = stringToSyntaxbaum('( {F} || A3 )');
val = sorted(rekursiv_atoms(fml));
assert 'F' not in val, 'Nichtatomare Formeln dürfen nicht vorkommen!';
def test_calc1(self):
fml = string_to_parts('A0');
fml = stringToSyntaxbaum('A0');
val = sorted(rekursiv_atoms(fml));
assert val == ['A0'], 'computed {}'.format(val);
def test_calc2(self):
fml = string_to_parts('((( ! A0 && A3 ) || A4 ) && A8 )');
fml = stringToSyntaxbaum('((( ! A0 && A3 ) || A4 ) && A8 )');
val = sorted(rekursiv_atoms(fml));
assert val == ['A0', 'A3', 'A4', 'A8'], 'computed {}'.format(val);
pass;
@@ -55,27 +94,27 @@ class TestRekursivAtoms(TestCase):
@unittest.skip('Methode noch nicht implementiert')
class TestRekursivDepth(TestCase):
def test_calc1(self):
fml = string_to_parts('A0');
fml = stringToSyntaxbaum('A0');
val = rekursiv_depth(fml);
assert val == 0, 'computed {}'.format(val);
def test_calc2(self):
fml = string_to_parts('!! A8');
fml = stringToSyntaxbaum('!! A8');
val = rekursiv_depth(fml);
assert val == 2, 'computed {}'.format(val);
def test_calc3(self):
fml = string_to_parts('( ! A0 && A3 )');
fml = stringToSyntaxbaum('( ! A0 && A3 )');
val = rekursiv_depth(fml);
assert val == 2, 'computed {}'.format(val);
def test_calc4(self):
fml = string_to_parts('((( ! A0 && A3 ) || A4 ) && A8 )');
fml = stringToSyntaxbaum('((( ! A0 && A3 ) || A4 ) && A8 )');
val = rekursiv_depth(fml);
assert val == 4, 'computed {}'.format(val);
def test_calc5(self):
fml = string_to_parts('! ((( ! A0 && A3 ) || A4 ) && A8 )');
fml = stringToSyntaxbaum('! ((( ! A0 && A3 ) || A4 ) && A8 )');
val = rekursiv_depth(fml);
assert val == 5, 'computed {}'.format(val);
pass;
@@ -87,32 +126,31 @@ class TestRekursivDepth(TestCase):
@unittest.skip('Methode noch nicht implementiert')
class TestRekursivLength(TestCase):
def test_calc1(self):
fml = string_to_parts('A0');
fml = stringToSyntaxbaum('A0');
val = rekursiv_length(fml);
assert val == 1, 'computed {}'.format(val);
def test_calc2(self):
fml = string_to_parts('!! A8');
fml = stringToSyntaxbaum('!! A8');
val = rekursiv_length(fml);
assert val == 3, 'computed {}'.format(val);
def test_calc3(self):
fml = string_to_parts('( ! A0 && A3 )');
fml = stringToSyntaxbaum('( ! A0 && A3 )');
val = rekursiv_length(fml);
assert val == 4, 'computed {}'.format(val);
def test_calc4(self):
fml = string_to_parts('((( ! A0 && A3 ) || A4 ) && A8 )');
fml = stringToSyntaxbaum('((( ! A0 && A3 ) || A4 ) && A8 )');
val = rekursiv_length(fml);
assert val == 8, 'computed {}'.format(val);
def test_calc5(self):
fml = string_to_parts('! ((( ! A0 && A3 ) || A4 ) && A8 )');
fml = stringToSyntaxbaum('! ((( ! A0 && A3 ) || A4 ) && A8 )');
val = rekursiv_length(fml);
assert val == 9, 'computed {}'.format(val);
pass;
# ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# TESTFALL Anzahl Klammern(·)
# ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
@@ -120,67 +158,27 @@ class TestRekursivLength(TestCase):
@unittest.skip('Methode noch nicht implementiert')
class TestRekursivParentheses(TestCase):
def test_calc1(self):
fml = string_to_parts('A0');
fml = stringToSyntaxbaum('A0');
val = rekursiv_parentheses(fml);
assert val == 0, 'computed {}'.format(val);
def test_calc2(self):
fml = string_to_parts('!! A8');
fml = stringToSyntaxbaum('!! A8');
val = rekursiv_parentheses(fml);
assert val == 0, 'computed {}'.format(val);
def test_calc3(self):
fml = string_to_parts('( ! A0 && A3 )');
fml = stringToSyntaxbaum('( ! A0 && A3 )');
val = rekursiv_parentheses(fml);
assert val == 2, 'computed {}'.format(val);
def test_calc4(self):
fml = string_to_parts('((( ! A0 && A3 ) || A4 ) && A8 )');
fml = stringToSyntaxbaum('((( ! A0 && A3 ) || A4 ) && A8 )');
val = rekursiv_parentheses(fml);
assert val == 6, 'computed {}'.format(val);
def test_calc5(self):
fml = string_to_parts('! ((( ! A0 && A3 ) || A4 ) && A8 )');
fml = stringToSyntaxbaum('! ((( ! A0 && A3 ) || A4 ) && A8 )');
val = rekursiv_parentheses(fml);
assert val == 6, 'computed {}'.format(val);
pass;
# ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# TESTFALL eval(·, ·)
# ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# @unittest.skip('Methode noch nicht implementiert')
class TestRekursivEval(TestCase):
def test_literale(self):
fml = string_to_parts('A0');
val = rekursiv_eval(fml, [ 'A0' ]);
assert val == 1;
fml = string_to_parts('A0');
val = rekursiv_eval(fml, []);
assert val == 0;
fml = string_to_parts('! A0');
val = rekursiv_eval(fml, [ 'A0' ]);
assert val == 0;
fml = string_to_parts('! A0');
val = rekursiv_eval(fml, []);
assert val == 1;
def test_complex1(self):
fml = string_to_parts('( ! A0 || (( A0 && A3 ) || A2 ))');
val = rekursiv_eval(fml, [ 'A0', 'A2' ]);
assert val == 1;
val = rekursiv_eval(fml, [ 'A0', 'A3' ]);
assert val == 1;
val = rekursiv_eval(fml, [ 'A0' ]);
assert val == 0;
val = rekursiv_eval(fml, [ 'A4', 'A8' ]);
assert val == 1;
def test_complex2(self):
fml = string_to_parts('( ! A0 || (( A0 && A3 ) || ! A2 ))');
val = rekursiv_eval(fml, [ 'A0', 'A2' ]);
assert val == 0;
val = rekursiv_eval(fml, [ 'A0', 'A3' ]);
assert val == 1;
pass;