Update CFG, DFA, NFA, and TM README files to standardize section headers and transition formats

Author: NurettinSelim

src/main/java/ContextFreeGrammar/ContextFreeGrammarREADME.md

@@ -24,13 +24,13 @@ Parsing is performed using the **CYK algorithm** (on Chomsky Normal Form).
 
 ## 3. CFG Definition File Format (`.cfg`)
 
-Each section starts with a keyword and `=`. Lines may contain comments (`# ...`) and blank lines.
+Each section starts with a keyword and `:`. Lines may contain comments (`# ...`) and blank lines.
 
 **Required sections:**
-- `Variables =` space-separated variable names (uppercase)
-- `Terminals =` space-separated terminal names (lowercase)
-- `Start =` one variable name (must be in `Variables`)
-- Productions: one per line, format `<Variable> -> <symbols> | <alternative> ...`
+- `vars:` space-separated variable names (uppercase)
+- `terminals:` space-separated terminal names (lowercase)
+- `start:` one variable name (must be in `vars`)
+- `rules:` header followed by production lines
 
 **Productions:**
 - Left side: a variable (non-terminal)
@@ -39,10 +39,11 @@ Each section starts with a keyword and `=`. Lines may contain comments (`# ...`)
 
 **Example**
 ```text
-Variables = S A B
-Terminals = a b
-Start = S
+vars: S A B
+terminals: a b
+start: S
 
+rules:
 S -> A B
 A -> a
 B -> b

src/main/java/DeterministicFiniteAutomaton/DeterministicFiniteAutomatonREADME.md

@@ -28,27 +28,28 @@ Each section begins with a keyword and a colon. Lines may contain comments (`# .
 - `states:` space-separated state names
 - `alphabet:` space-separated input symbols (single chars)
 - `start:` one state name
-- `finals:` space-separated accepting states
+- `accept:` space-separated accepting states
 - `transitions:` one transition per line (see below)
 
 **Transitions**
 ```
-<fromState> <inputSymbol> -> <toState>
+<fromState>, <inputSymbol> -> <toState>
 ```
 
 **Example**
 ```text
 states: q0 q1 q2
 alphabet: a b
 start: q0
-finals: q2
+accept: q2
+
 transitions:
-q0 -> q1 (a)
-q0 -> q0 (b)
-q1 -> q1 (a)
-q1 -> q2 (b)
-q2 -> q1 (a)
-q2 -> q0 (b)
+q0, a -> q1
+q0, b -> q0
+q1, a -> q1
+q1, b -> q2
+q2, a -> q1
+q2, b -> q0
 ```
 
 ## 4. Components

src/main/java/NondeterministicFiniteAutomaton/NondeterministicFiniteAutomatonREADME.md

@@ -31,29 +31,32 @@ Each section begins with a keyword and a colon. Lines may contain comments (`# .
 - `states:` space-separated state names
 - `alphabet:` space-separated input symbols (single chars)
 - `start:` one state name
-- `finals:` space-separated accepting states
+- `accept:` space-separated accepting states
 - `transitions:` one transition per line (see below)
 
 **Transitions**
 ```
-<fromState> -> <toState> (<inputSymbol(s)>)
+<fromState>, <inputSymbol> -> <toState>
 ```
 - \<inputSymbol> can be ***eps*** to indicate an epsilon transition.
-- For each (\<fromState>, \<toState>) pair, there must be ***at most one line***.
+- Each transition is on its own line with exactly one symbol.
 
 **Example**
 ```text
 states: q0 q1 q2
-start: q0
-finals: q2
 alphabet: a b
+start: q0
+accept: q2
+
 transitions:
-q0 -> q1 (a eps)
-q0 -> q0 (b)
-q1 -> q1 (eps)
-q1 -> q2 (b)
-q2 -> q1 (a)
-q2 -> q0 (b eps)
+q0, a -> q1
+q0, eps -> q1
+q0, b -> q0
+q1, eps -> q1
+q1, b -> q2
+q2, a -> q1
+q2, b -> q0
+q2, eps -> q0
 ```
 
 ## 4. Components

src/main/java/TuringMachine/TMREADME.md

@@ -48,34 +48,35 @@ To use the module, you must define a TM in a text file with specific sections. E
 
 ### Required Sections
 -   `states`: A space-separated list of all state names (e.g., `q0 q1 q_accept`).
--   `input_alphabet`: Space-separated symbols for the input.
--   `tape_alphabet`: Space-separated symbols allowed on the tape (must include input alphabet symbols).
+-   `input`: Space-separated symbols for the input.
+-   `tape`: Space-separated symbols allowed on the tape (must include input alphabet symbols).
 -   `start`: The name of the start state.
 -   `accept`: The name of the accept state.
+-   `reject`: The name of the reject state.
 -   `transitions`: The header for the transition rules.
 
 ### Transitions
 Each transition rule must be on a new line in the format:
-`<current_state> <read_symbol> -> <next_state> <write_symbol> <direction>`
-(Example: `q0 0 -> q1 X R`)
+`<current_state>, <read_symbol> -> <next_state>, <write_symbol>, <direction>`
+(Example: `q0, 0 -> q1, X, R`)
 
 ### Example `.tm` File
 This TM accepts strings with an even number of zeros.
 ```
 states: q0 q1 q_accept q_reject
-input_alphabet: 0 1
-tape_alphabet: 0 1 _
+input: 0 1
+tape: 0 1 _
 start: q0
 accept: q_accept
 reject: q_reject
 
 transitions:
-q0 0 -> q1 0 R
-q0 1 -> q0 1 R
-q0 _ -> q_accept _ R
-q1 0 -> q0 0 R
-q1 1 -> q1 1 R
-q1 _ -> q_reject _ R
+q0, 0 -> q1, 0, R
+q0, 1 -> q0, 1, R
+q0, _ -> q_accept, _, R
+q1, 0 -> q0, 0, R
+q1, 1 -> q1, 1, R
+q1, _ -> q_reject, _, R
 ```
 
 ## 4. Core Java Components

src/test/java/DeterministicFiniteAutomaton/dfa.txt

@@ -1,21 +1,30 @@
-Start: q0
-Finals: q5 q7
-Alphabet: a b c
-States: q0 q1 q2 q3 q4 q5 q6 q7
+states: q0 q1 q2 q3 q4 q5 q6 q7
+alphabet: a b c
+start: q0
+accept: q5 q7
 
-Transitions:
-q0 -> q0 (c)
-q0 -> q1 (a b)
-q1 -> q2 (a)
-q1 -> q3 (b)
-q1 -> q1 (c)
-q2 -> q2 (a c)
-q5 -> q5 (a b c)
-q2 -> q4 (b)
-q4 -> q5 (a)
-q3 -> q4 (a)
-q6 -> q7 (a)
-q3 -> q3 (b c)
-q4 -> q6 (b c)
-q6 -> q0 (b c)
-q7 -> q7 (a b c)
+transitions:
+q0, c -> q0
+q0, a -> q1
+q0, b -> q1
+q1, a -> q2
+q1, b -> q3
+q1, c -> q1
+q2, a -> q2
+q2, c -> q2
+q5, a -> q5
+q5, b -> q5
+q5, c -> q5
+q2, b -> q4
+q4, a -> q5
+q3, a -> q4
+q6, a -> q7
+q3, b -> q3
+q3, c -> q3
+q4, b -> q6
+q4, c -> q6
+q6, b -> q0
+q6, c -> q0
+q7, a -> q7
+q7, b -> q7
+q7, c -> q7

src/test/java/common/GraphvizEngineTest.java

@@ -59,7 +59,7 @@ void testDFASimpleRendering() {
                 "states: q0 q1 q2\n" +
                         "alphabet: a b\n" +
                         "start: q0\n" +
-                        "finals: q2\n" +
+                        "accept: q2\n" +
                         "\n" +
                         "transitions:\n" +
                         "q0, a -> q1\n" +

src/test/java/service/TestServiceValidationTest.java

@@ -54,7 +54,7 @@ void testDfaSuccess() throws IOException {
                 "states: q0 q1\n" +
                 "alphabet: a b\n" +
                 "start: q0\n" +
-                "finals: q1\n" +
+                "accept: q1\n" +
                 "\n" +
                 "transitions:\n" +
                 "q0, a -> q1\n" +
@@ -390,7 +390,7 @@ void testNullAutomaton() throws IOException {
         @DisplayName("should throw exception for null test file path")
         void testNullTestFilePath() {
             DFA dfa = new DFA();
-            dfa.parse("states: q0\nalphabet: a\nstart: q0\nfinals: q0\n\ntransitions:\nq0, a -> q0\n");
+            dfa.parse("states: q0\nalphabet: a\nstart: q0\naccept: q0\n\ntransitions:\nq0, a -> q0\n");
             SessionService.TestSettings settings = new SessionService.TestSettings(
                 0, 100, 30, null, null, null);
 
@@ -402,7 +402,7 @@ void testNullTestFilePath() {
         @DisplayName("should throw exception for null settings")
         void testNullSettings() throws IOException {
             DFA dfa = new DFA();
-            dfa.parse("states: q0\nalphabet: a\nstart: q0\nfinals: q0\n\ntransitions:\nq0, a -> q0\n");
+            dfa.parse("states: q0\nalphabet: a\nstart: q0\naccept: q0\n\ntransitions:\nq0, a -> q0\n");
             File testFile = createTestFile("a,1\n");
 
             assertThrows(IllegalArgumentException.class, () ->