diff options
| author | Jedidiah Barber <contact@jedbarber.id.au> | 2021-07-14 17:41:24 +1200 |
|---|---|---|
| committer | Jedidiah Barber <contact@jedbarber.id.au> | 2021-07-14 17:41:24 +1200 |
| commit | f7673a44ecb497f9d9496bb5a3b2217b8a9fe74c (patch) | |
| tree | 1019407f5c39cff0c41aee0c10e9baf02ee2cb8e /project/templates/packrat.html | |
| parent | 727e6c9502923b2bcae298282a81e4bd483df4d5 (diff) | |
Fixed minor source formatting errors
Diffstat (limited to 'project/templates/packrat.html')
| -rw-r--r-- | project/templates/packrat.html | 3 |
1 files changed, 2 insertions, 1 deletions
diff --git a/project/templates/packrat.html b/project/templates/packrat.html index 321b71c..ec516d3 100644 --- a/project/templates/packrat.html +++ b/project/templates/packrat.html @@ -123,7 +123,8 @@ then a clearer view immediately follows.</p> <p>What is the condition? Exactly as described above for direct left recursion. Through comparing recursion counts with the amount of unconsumed input we determine that a result of no successful -parse can be calculated, and that the result is valid for reuse for any deeper recursion of the same combinator at that input position.</p> +parse can be calculated, and that the result is valid for reuse for any deeper recursion of the same +combinator at that input position.</p> <p>From that can be derived:</p> <ul> |