Task C06 start
This commit is contained in:
parent
1d3aecc49a
commit
3a2cbcc7ca
139
TaskC06/run.py
Normal file
139
TaskC06/run.py
Normal file
@ -0,0 +1,139 @@
|
||||
import re
|
||||
import sys
|
||||
import csv
|
||||
|
||||
from numpy import append
|
||||
|
||||
DEBUG = False
|
||||
alfabet = "xyz"
|
||||
SEMICOLON = ";"
|
||||
|
||||
# sys.setrecursionlimit(4100)
|
||||
|
||||
|
||||
def print_debug(*args, **kwargs):
|
||||
if DEBUG:
|
||||
print(*args, **kwargs)
|
||||
|
||||
|
||||
if len(sys.argv) == 1:
|
||||
print("Default arguments parsed\n")
|
||||
sys.argv.append("medium.in")
|
||||
sys.argv.append("medium.exp")
|
||||
|
||||
with open(sys.argv[1], mode="r", newline="", encoding="utf8") as csvfile:
|
||||
filereader = csv.reader(csvfile, delimiter="\t", quotechar="|")
|
||||
fsa_description = list(filereader)
|
||||
|
||||
# skip first line with comment
|
||||
if fsa_description[0][0][0] == "#":
|
||||
fsa_description = fsa_description[1:]
|
||||
|
||||
# get accepting states
|
||||
accepting_states = []
|
||||
|
||||
fsa_description_map: dict[tuple[str, str], list[str]] = {}
|
||||
fsa_description_direction: dict[str, list[tuple[str, str]]] = {}
|
||||
is_error = False
|
||||
for num, item in enumerate(fsa_description):
|
||||
if len(item) == 1:
|
||||
accepting_states.append(item[0])
|
||||
continue
|
||||
|
||||
for letter in item[2]:
|
||||
if letter not in alfabet:
|
||||
print_debug(
|
||||
"WARNING - letter not in alfabet: ", letter, "| line:", num + 1
|
||||
)
|
||||
tupleItems = (item[0], letter)
|
||||
if (item[0], letter) in fsa_description_map:
|
||||
print_debug(
|
||||
f"WARNING - duplicate letter: key = ({item[0]} | {letter}) | line: {num + 1}"
|
||||
)
|
||||
# append to description map or create it if it doesn't exist
|
||||
fsa_description_map[tupleItems] = fsa_description_map.get(
|
||||
tupleItems, []
|
||||
) + [item[1]]
|
||||
fsa_description_direction[item[0]] = fsa_description_direction.get(
|
||||
item[0], []
|
||||
) + [(item[1], letter)]
|
||||
|
||||
if is_error:
|
||||
exit(-1)
|
||||
|
||||
states = {}
|
||||
for item in fsa_description_map:
|
||||
states[item[0]] = states[item[0]] + item[1] if item[0] in states else item[1]
|
||||
|
||||
|
||||
from collections import Counter
|
||||
|
||||
|
||||
# check if all letters are used once
|
||||
def is_permutation(str1, str2):
|
||||
return Counter(str1) == Counter(str2)
|
||||
|
||||
|
||||
def find_missing_letters(str1, str2) -> str:
|
||||
missing_letters = ""
|
||||
for char in str2:
|
||||
if char not in str1:
|
||||
missing_letters += char
|
||||
return missing_letters
|
||||
|
||||
|
||||
for state in states:
|
||||
if not is_permutation(states[state], alfabet):
|
||||
print_debug(
|
||||
f"WARNING - state {state} doesn't match full alphabet: {states[state]} | {alfabet} | diff - {find_missing_letters(states[state], alfabet)}"
|
||||
)
|
||||
# exit(-1)
|
||||
|
||||
|
||||
with open(sys.argv[2], mode="r", newline="", encoding="utf8") as file:
|
||||
content = file.read()
|
||||
test_out = content.splitlines()
|
||||
|
||||
|
||||
def is_correct(current_state: str) -> bool:
|
||||
if current_state in accepting_states:
|
||||
return True
|
||||
return False
|
||||
|
||||
|
||||
def find_language(current_state: str) -> list[str]:
|
||||
good_end_states: list[str] = []
|
||||
|
||||
for next_state, description in fsa_description_direction[current_state]:
|
||||
new_good_end_states = find_language(next_state)
|
||||
for new_good_end_state in new_good_end_states:
|
||||
if new_good_end_state != "" and new_good_end_state != "-1":
|
||||
good_end_states.append(description + new_good_end_state)
|
||||
|
||||
if is_correct(current_state):
|
||||
return [""]
|
||||
else:
|
||||
return ["-1"]
|
||||
|
||||
return good_end_states
|
||||
|
||||
|
||||
is_difference = []
|
||||
current_state = "0"
|
||||
|
||||
language = find_language(current_state)
|
||||
|
||||
# language.sort(key=lambda x: x.encode("utf-8"))
|
||||
|
||||
for i, word in enumerate(language):
|
||||
if i > 10:
|
||||
break
|
||||
if word != test_out[i]:
|
||||
is_difference.append(i + 1)
|
||||
print(word, test_out[i])
|
||||
else:
|
||||
print(word)
|
||||
|
||||
|
||||
if len(is_difference) != 0:
|
||||
print(is_difference)
|
Loading…
Reference in New Issue
Block a user