In this project we implement the naïve algorithm and the Automaton algorithm for exact matching [1] and parameterized matching [2]. The program compares the running time of both algorithms and puts the results in a file.
input:
One argument which is the file path to a csv file with the running instructions: Every line in the file represents all the arguments for a single test:
- Path to text
- Path to pattern
- Size of the alphabet
- Boolian – 1 if should test parameterized matching, 0 if should test exact matching
- Length of the pattern (if do not want to use the whole pattern in the path). This argument is optional
Output:
- Csv file with the time taken by each algorithm and the number of matches
- File with the positions of the matches in the text