From e72477d674b35b8a029ecec58b877147159d65b5 Mon Sep 17 00:00:00 2001 From: Mees Delzenne Date: Fri, 10 May 2024 13:44:01 +0200 Subject: [PATCH] Fix spelling mistake in README --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index a23a289..f83dc06 100644 --- a/README.md +++ b/README.md @@ -12,7 +12,7 @@ overflow the stack, regardless of depth. ## What is this crate for? There are some types of algorithms which are easiest to write as a recursive algorithm. -Examples include a recursive decent parsers and tree-walking interpreters. +Examples include a recursive descent parsers and tree-walking interpreters. These algorithms often need to keep track of complex stack of state and are therefore easiest to write as a set of recursive function calling each other. This does however have a major downside: The stack can be rather limited. Especially when the input of a algorithm is externally controlled, implementing it as a recursive algorithm is asking for stack overflows.