Another left recursion removal test

alib2algo/test-src/grammar/simplify/GrammarLeftRecursionRemoverTest.cpp

 #include "GrammarLeftRecursionRemoverTest.h"
 #include "grammar/simplify/LeftRecursionRemover.h"
+#include "grammar/generate/GenerateUpToLength.h"
 #include "grammar/ContextFree/CFG.h"
 #include "grammar/ContextFree/EpsilonFreeCFG.h"
@@ -184,3 +185,26 @@ void GrammarLeftRecursionRemoverTest::testRemoveEpsilonRules4() {
 	CPPUNIT_ASSERT(grammar2 == grammar3);
 }
+void GrammarLeftRecursionRemoverTest::testRemoveEpsilonRules5() {
+	alphabet::Symbol A = alphabet::symbolFrom("A");
+	alphabet::Symbol B = alphabet::symbolFrom("B");
+	alphabet::Symbol C = alphabet::symbolFrom("C");
+
+	alphabet::Symbol a = alphabet::symbolFrom('a');
+	alphabet::Symbol b = alphabet::symbolFrom('b');
+
+	grammar::EpsilonFreeCFG grammar1(A);
+	grammar1.setNonterminalAlphabet({A, B, C});
+	grammar1.setTerminalAlphabet({a, b});
+	grammar1.addRule(A, {B, C});
+	grammar1.addRule(A, {a});
+	grammar1.addRule(B, {C, A});
+	grammar1.addRule(B, {A, b});
+	grammar1.addRule(C, {A, B});
+	grammar1.addRule(C, {C, C});
+	grammar1.addRule(C, {a});
+
+	grammar::EpsilonFreeCFG grammar2 = grammar::simplify::LeftRecursionRemover::remove(grammar1);
+
+	CPPUNIT_ASSERT(grammar::generate::GenerateUpToLength::generate(grammar1, 7) == grammar::generate::GenerateUpToLength::generate(grammar2, 7));
+}

alib2algo/test-src/grammar/simplify/GrammarLeftRecursionRemoverTest.h

@@ -10,6 +10,7 @@ class GrammarLeftRecursionRemoverTest : public CppUnit::TestFixture
   CPPUNIT_TEST( testRemoveEpsilonRules2 );
   CPPUNIT_TEST( testRemoveEpsilonRules3 );
   CPPUNIT_TEST( testRemoveEpsilonRules4 );
+  CPPUNIT_TEST( testRemoveEpsilonRules5 );
   CPPUNIT_TEST_SUITE_END();
 public:
@@ -20,6 +21,7 @@ public:
   void testRemoveEpsilonRules2();
   void testRemoveEpsilonRules3();
   void testRemoveEpsilonRules4();
+  void testRemoveEpsilonRules5();
 };
 #endif /* GRAMMAR_EPSILON_REMOVER_TEST_H_ */