Labs1

.idea/DJFZ-2023.iml

@@ -0,0 +1,9 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="JAVA_MODULE" version="4">
+  <component name="NewModuleRootManager" inherit-compiler-output="true">
+    <exclude-output />
+    <content url="file://$MODULE_DIR$" />
+    <orderEntry type="inheritedJdk" />
+    <orderEntry type="sourceFolder" forTests="false" />
+  </component>
+</module>

.idea/jpa-buddy.xml

@@ -0,0 +1,6 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="JpaBuddyIdeaProjectConfig">
+    <option name="renamerInitialized" value="true" />
+  </component>
+</project>

.idea/misc.xml

@@ -0,0 +1,9 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="ProjectRootManager" version="2" languageLevel="JDK_18" project-jdk-name="Python 3.11 (PythonTest)" project-jdk-type="Python SDK">
+    <output url="file://$PROJECT_DIR$/out" />
+  </component>
+  <component name="ProjectType">
+    <option name="id" value="jpab" />
+  </component>
+</project>

.idea/modules.xml

@@ -0,0 +1,8 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="ProjectModuleManager">
+    <modules>
+      <module fileurl="file://$PROJECT_DIR$/.idea/DJFZ-2023.iml" filepath="$PROJECT_DIR$/.idea/DJFZ-2023.iml" />
+    </modules>
+  </component>
+</project>

README.md

@@ -0,0 +1,50 @@
+## Zajęcia 1 16.10.2023
+
+### Informacje na temat przedmiotu
+
+Prowadzący: mgr inż. Bartosz Fijałkowski
+mail: bf55466@st.amu.edu.pl
+
+Gdyby była potrzeba przedyskutowania czegoś to możemy zostać po zajęciach. Można też kontaktować się ze mną mailowo.
+
+W celu zaliczenia przedmiotu należy zdobyć punkty za zadania na laboratoriach oraz zaliczyć kolokwium.
+Punktowane zadania będziemy wykonywać na laboratoriach oraz po nich (przed następnymi zajęciami), ich ilość determinuje ocenę.
+Oprócz tego należy zaliczyć kolokwium z wyrażeń regularnych na ostatnich zajęciach. Sam wynik kolokwium 
+nie będzie wpływał na ocenę, ale bez zdanego kolowkium nie da się zaliczyć przedmiotu. Punktacja za zadania jest następująca:
+  - mniej niż 30 punktów - 2
+  - 30-34- 3
+  - 35-39- 3.5
+  - 40-44- 4
+  - 45-49- 4.5
+  - więcej niż 49- 5
+
+#### Wysyłanie zadań 
+
+Proszę stworzyć prywatne repozytorium na https://git.wmi.amu.edu.pl/ o nazwie djfz-2023-sNRINDEKSU oraz dać 
+prawa do odczytu użytkownikowi bfijalkowski (prowadzący przedmiot). W NRINDEKSU proszę wpisać swój nr indeksu, np. djfz-2023-s123456.
+
+Następnie w swoim repozytorium proszę spullować niniejsze repozytorium: `git pull git@git.wmi.amu.edu.pl:bfijalkowski/DJFZ-2023.git`
+W ten sposób będziemy aktualizować zadania co zajęcia.
+
+Proszę rozwiązać zadanie TASKX02 lub TASKX03 w zależności od numeru indeksu. W tym celu należy dodać plik `run.py`
+w odpowiednim katalogu. Za pomocą `run_reports.py` można sprawdzić ilość punktów.
+
+Do repo proszę dodawać wyłącznie plik `run.py` w odpowiednim katalogu, chyba że w zadaniu jest zaznaczone inaczej.
+Proszę również nie modyfikować innych plików.
+
+Wszystkie zadania należy robić w terminie zaznaczonym w `description.txt`. Po terminie będę podawał punktację za pomocą USOSa w "sprawdziany".
+
+Zadania robimy do dnia poprzedzającego następne zajęcia.
+
+#### Aktualizacja repozytorium
+
+We własnym repozytorium:
+
+`git pull git@git.wmi.amu.edu.pl:bfijalkowski/DJFZ-2023.git`
+
+## Zajęcia 1 16.10.2023 Automaty deterministyczne skończone
+
+B00 - zadanie wykonywane wspólnie na zajęciach
+B01-B04, B06-B09 - po jedno dla każdego
+B05 - jedno dla wszystkich
+

TaskB00/description.txt

@@ -8,4 +8,4 @@ automaton, write YES, otherwise- write NO.
 The program is invoked like this: ./run.py fsa_description.arg < test1.in > test1.out
 
 POINTS: 3
-DEADLINE: 2020-11-07 23:59:00
+DEADLINE: 2023-10-29 23:59:59

TaskB00/test1.out

@@ -0,0 +1,9 @@
+NO
+YES
+NO
+NO
+NO
+NO
+NO
+NO
+NO

TaskB01/description.txt

@@ -0,0 +1,13 @@
+Use a deterministic finite-state automaton (FSA) engine from the TaskB00.
+Create your own FSA description to check whether the string starts with "01" and ends with "01.
+Save it to fsa_description.arg file.
+
+The alphabet is "0", "1".
+
+Read strings from the standard input.
+If a string is accepted by the
+automaton, write YES, otherwise- write NO.
+
+POINTS: 2
+DEADLINE: 2020-11-07 23:59:00
+REMAINDER: 1/4

TaskB01/test.exp

@@ -0,0 +1,14 @@
+YES
+NO
+YES
+NO
+YES
+NO
+NO
+YES
+NO
+NO
+NO
+NO
+NO
+NO

TaskB01/test.in

@@ -0,0 +1,14 @@
+01
+10
+0101
+1010
+011101
+101010
+100010
+0100001
+
+00110
+0000
+10101
+0
+1

TaskB02/description.txt

@@ -0,0 +1,13 @@
+Use a deterministic finite-state automaton (FSA) engine from the TaskB00.
+Create your own FSA description to check whether the string starts with "10" and ends with "10.
+Save it to fsa_description.arg file.
+
+The alphabet is "0", "1".
+
+Read strings from the standard input.
+If a string is accepted by the
+automaton, write YES, otherwise- write NO.
+
+POINTS: 2
+DEADLINE: 2020-11-07 23:59:00
+REMAINDER: 2/4

TaskB02/test.exp

@@ -0,0 +1,14 @@
+NO
+YES
+NO
+YES
+NO
+YES
+YES
+NO
+NO
+NO
+NO
+NO
+NO
+NO

TaskB02/test.in

@@ -0,0 +1,14 @@
+01
+10
+0101
+1010
+011101
+101010
+100010
+0100001
+
+00110
+0000
+10101
+0
+1

TaskB03/description.txt

@@ -0,0 +1,14 @@
+Use a deterministic finite-state automaton (FSA) engine from the TaskB00.
+Create your own FSA description to check whether the string contains "0"
+even number of times.
+Save it to fsa_description.arg file.
+
+The alphabet is "0", "1".
+
+Read strings from the standard input.
+If a string is accepted by the
+automaton, write YES, otherwise- write NO.
+
+POINTS: 2
+DEADLINE: 2020-11-07 23:59:00
+REMAINDER: 3/4

TaskB03/test.exp

@@ -0,0 +1,14 @@
+NO
+NO
+YES
+YES
+YES
+NO
+YES
+NO
+YES
+NO
+YES
+YES
+NO
+YES

TaskB03/test.in

@@ -0,0 +1,14 @@
+01
+10
+0101
+1010
+011101
+101010
+100010
+0100001
+
+00110
+0000
+10101
+0
+1

TaskB03/test.out

@@ -0,0 +1,14 @@
+NO
+NO
+YES
+YES
+YES
+NO
+YES
+NO
+YES
+NO
+YES
+YES
+NO
+YES

TaskB04/description.txt

@@ -0,0 +1,14 @@
+Use a deterministic finite-state automaton (FSA) engine from the TaskB00.
+Create your own FSA description to check whether the string contains "0"
+odd number of times.
+Save it to fsa_description.arg file.
+
+The alphabet is "0", "1".
+
+Read strings from the standard input.
+If a string is accepted by the
+automaton, write YES, otherwise- write NO.
+
+POINTS: 2
+DEADLINE: 2020-11-07 23:59:00
+REMAINDER: 0/4

TaskB04/test.exp

@@ -0,0 +1,14 @@
+YES
+YES
+NO
+NO
+NO
+YES
+NO
+YES
+NO
+YES
+NO
+NO
+YES
+NO

TaskB04/test.in

@@ -0,0 +1,14 @@
+01
+10
+0101
+1010
+011101
+101010
+100010
+0100001
+
+00110
+0000
+10101
+0
+1

TaskB05/description.txt

@@ -0,0 +1,12 @@
+Use a deterministic finite-state automaton (FSA) engine from the TaskB00.
+Create your own FSA description to check whether the line contains string '19DD', where D is a digit.
+Save it to fsa_description.arg file.
+
+FSA alphabet is '0123456789x'.
+
+Read strings from the standard input.
+If a string is accepted by the
+automaton, write YES, otherwise- write NO.
+
+POINTS: 2
+DEADLINE: 2020-11-07 23:59:00

TaskB05/simple.exp

@@ -0,0 +1,6 @@
+NO
+YES
+NO
+NO
+YES
+YES

TaskB05/simple.in

@@ -0,0 +1,6 @@
+3214545443
+1910
+19
+xxx2190x
+xxx21905x
+1905x54545

TaskB05/simple.out

@@ -0,0 +1,6 @@
+NO
+YES
+NO
+NO
+YES
+YES

TaskB06/description.txt

@@ -0,0 +1,13 @@
+Use a deterministic finite-state automaton (FSA) engine from the previous task.
+Create your own FSA description to check whether the word "hamlet" is in the given line.
+Save it to fsa_description.arg file.
+
+FSA alphabet is 'abcdefghijklmnopqrstuvwxyz '.
+
+Read strings from the standard input.
+If a string is accepted by the
+automaton, write YES, otherwise- write NO.
+
+POINTS: 3
+DEADLINE: 2020-11-07 23:59:00
+REMAINDER: 0/4

TaskB06/simple.exp

@@ -0,0 +1,3 @@
+NO
+YES
+YES

TaskB06/simple.in

@@ -0,0 +1,3 @@
+haml
+hamlet
+aaahamletbbb

TaskB07/description.txt

@@ -0,0 +1,13 @@
+Use a deterministic finite-state automaton (FSA) engine from the previous task.
+Create your own FSA description to check whether the word "ophelia" is in the given line.
+Save it to fsa_description.arg file.
+
+FSA alphabet is 'abcdefghijklmnopqrstuvwxyz '.
+
+Read strings from the standard input.
+If a string is accepted by the
+automaton, write YES, otherwise- write NO.
+
+POINTS: 3
+DEADLINE: 2020-11-07 23:59:00
+REMAINDER: 1/4

TaskB07/simple.exp

@@ -0,0 +1,3 @@
+NO
+YES
+YES

TaskB07/simple.in

@@ -0,0 +1,3 @@
+oph
+ophelia
+xfdfdopheliafff

TaskB08/description.txt

@@ -0,0 +1,13 @@
+Use a deterministic finite-state automaton (FSA) engine from the previous task.
+Create your own FSA description to check whether the word "juliet" is in the given line.
+Save it to fsa_description.arg file.
+
+FSA alphabet is 'abcdefghijklmnopqrstuvwxyz '.
+
+Read strings from the standard input.
+If a string is accepted by the
+automaton, write YES, otherwise- write NO.
+
+POINTS: 3
+DEADLINE: 2020-11-07 23:59:00
+REMAINDER: 2/4

TaskB08/simple.exp

@@ -0,0 +1,3 @@
+NO
+YES
+YES

TaskB08/simple.in

@@ -0,0 +1,3 @@
+juli
+juliet
+dgfdgjulietaaa

TaskB09/description.txt

@@ -0,0 +1,13 @@
+Use a deterministic finite-state automaton (FSA) engine from the previous task.
+Create your own FSA description to check whether the word "macbeth" is in the given line.
+Save it to fsa_description.arg file.
+
+FSA alphabet is 'abcdefghijklmnopqrstuvwxyz '.
+
+Read strings from the standard input.
+If a string is accepted by the
+automaton, write YES, otherwise- write NO.
+
+POINTS: 3
+DEADLINE: 2020-11-07 23:59:00
+REMAINDER: 3/4

TaskB09/simple.exp

@@ -0,0 +1,3 @@
+NO
+YES
+YES

TaskB09/simple.in

@@ -0,0 +1,3 @@
+macb
+macbeth
+xadadamacbethrff

TaskX01/complex.exp

@@ -0,0 +1 @@
+15

TaskX01/complex.in

@@ -0,0 +1,5 @@
+1
+2
+3
+4
+5

TaskX01/complex.out

@@ -0,0 +1 @@
+15

TaskX01/description.txt

@@ -0,0 +1,6 @@
+Print the sum of integers read from the standard input.
+Note: this is just an example of a task (and a solution).
+The task has a solution already, do not solve it!
+
+POINTS: 1
+DEADLINE: 2023-10-29 23:59:59

TaskX01/run.py

@@ -0,0 +1,7 @@
+import sys
+
+count = 0
+for line in sys.stdin:
+    count += int(line)
+
+print(count)

TaskX01/simple.exp

@@ -0,0 +1 @@
+4

TaskX01/simple.in

@@ -0,0 +1,2 @@
+2
+2

TaskX01/simple.out

@@ -0,0 +1 @@
+4

TaskX02/description.txt

@@ -0,0 +1,5 @@
+Print the number lines read from the standard input.
+
+POINTS: 1
+DEADLINE: 2023-10-29 23:59:59
+REMAINDER 0/2

TaskX02/simple.exp

@@ -0,0 +1 @@
+3

TaskX02/simple.in

@@ -0,0 +1,3 @@
+raz
+dwa
+trzy

TaskX03/description.txt

@@ -0,0 +1,6 @@
+For each line read from the standard input print the number of characters
+(not counting the end-of-line character), a space and the line read.
+
+POINTS: 1
+DEADLINE: 2023-10-29 23:59:59
+REMAINDER 1/2

TaskX03/simple.exp

@@ -0,0 +1,4 @@
+9 Szeregowy
+4 Rico
+8 Kowalski
+7 Skipper

TaskX03/simple.in

@@ -0,0 +1,4 @@
+Szeregowy
+Rico
+Kowalski
+Skipper

TaskX03/simple.out

@@ -0,0 +1,4 @@
+9 Szeregowy
+4 Rico
+8 Kowalski
+7 Skipper

run_report.py

@@ -0,0 +1,109 @@
+from pathlib import Path
+import subprocess
+
+
+def get_tasks_sets(dir):
+    return [str(a.name).replace('.in', '') for a in Path(dir).glob('*in')]
+
+
+def execute_task(dir):
+    task_sets = get_tasks_sets(dir)
+    for task_set in task_sets:
+        try:
+            with open(Path(dir, f'{task_set}.in')) as f_in, open(Path(dir, f'{task_set}.out'), 'w') as f_out:
+                arg = [x for x in dir.iterdir() if str(x).endswith('.arg')]  #  arg = [x for x in dir.iterdir() if str(x).endswith(f'{task_set}.arg')]
+                if str(dir).startswith('TaskH'):
+                    compilation_command = ['thraxcompiler', f'--input_grammar={Path(dir, "grammar.grm")}',
+                                           f'--output_far={Path(dir, "grammar.far")}']
+                    process = subprocess.Popen(compilation_command, stdout=subprocess.DEVNULL,
+                                               stderr=subprocess.DEVNULL)
+                    process.wait()
+                    command = ['thraxrewrite-tester', f'--far={Path(dir, "grammar.far")}', f'--rules=FinalRule']
+                else:
+                    command = ['python3', Path(dir, 'run.py')]
+                    if len(arg) != 0:
+                        command.append(arg[0])
+                process = subprocess.Popen(command,
+                                           stdin=f_in,
+                                           stdout=f_out,
+                                           stderr=subprocess.DEVNULL)
+                process.wait()
+                f_out.flush()
+        except:
+            pass
+
+
+def get_index():
+    return int(Path.cwd().name.split('-')[-1][1:30])
+
+
+def is_task_set_correct(dir, task_set):
+    try:
+        with open(Path(dir, f'{task_set}.out')) as f_exp, open(Path(dir, f'{task_set}.exp')) as f_out:
+            f_out_lines = ''.join(f_out.readlines())
+            f_exp_lines = ''.join(f_exp.readlines())
+            return f_out_lines == f_exp_lines
+    except:
+        pass
+
+
+def is_task_correct(dir):
+    task_sets = get_tasks_sets(dir)
+    for task_set in task_sets:
+        if not is_task_set_correct(dir, task_set):
+            return False
+    return True
+
+
+def does_task_match_index(dir, index):
+    with open(Path(dir, f'description.txt')) as f_in:
+        lines = f_in.readlines()
+        remainder_lines = [x for x in lines if x.startswith('REMAINDER')]
+        if len(remainder_lines) == 0:
+            return True
+        else:
+            remainder, modulus = remainder_lines[0].split(' ')[-1].split('/')
+            remainder = int(remainder)
+            modulus = int(modulus)
+            return (index % modulus) == remainder
+
+
+def get_tasks(index):
+    all_tasks = Path('.').glob('Task*')
+    return [task for task in all_tasks if does_task_match_index(task, index)]
+
+
+def execute_all_tasks(tasks):
+    for task in tasks:
+        execute_task(task)
+
+
+def get_task_points(dir):
+    with open(Path(dir, 'description.txt')) as f_in:
+        lines = f_in.readlines()
+        points = int([x for x in lines if x.startswith('POINTS')][0].split(' ')[-1].rstrip())
+        return points
+
+
+def get_report(tasks):
+    report = dict()
+    for task in tasks:
+        if is_task_correct(task):
+            report[task] = get_task_points(task)
+        else:
+            report[task] = 0
+    return report
+
+
+def print_report(report):
+    for k in sorted(report):
+        print(f'{k}: {report[k]}')
+    print('')
+    print(f'SUMMARY: {sum(report.values())}')
+
+
+INDEX = get_index()
+tasks = get_tasks(INDEX)
+execute_all_tasks(tasks)
+report = get_report(tasks)
+print_report(report)