Optimization: Replace head recursion by tail recursion in matching

1 files changed, 1 insertions, 0 deletions

diff --git a/bnf.h b/bnf.h
index e5c62ed..4ad782a 100644
--- a/bnf.h
+++ b/bnf.h
@@ -15,6 +15,7 @@ std::unordered_map<std::string, std::unordered_set<std::string>> Reverse(const B
 std::unordered_map<std::string, std::unordered_set<std::string>> reverseFirst(const BNF& bnf);
 
 BNF SubBNF(const BNF& bnf, const std::string& top);
+BNF removeHeadRecursion(const BNF& bnf);
 
 bool isTerminal(const BNF& bnf, const std::string& symbol);
 std::unordered_set<std::string> getTerminals(const BNF& bnf);