summaryrefslogtreecommitdiff
path: root/project/templates/packrat.html
diff options
context:
space:
mode:
Diffstat (limited to 'project/templates/packrat.html')
-rw-r--r--project/templates/packrat.html12
1 files changed, 8 insertions, 4 deletions
diff --git a/project/templates/packrat.html b/project/templates/packrat.html
index 17dbfc0..221b2cc 100644
--- a/project/templates/packrat.html
+++ b/project/templates/packrat.html
@@ -13,7 +13,7 @@
<h4>Packrat Parser Combinator Library</h4>
<p>Git repository: <a href="/cgit/cgit.cgi/packrat">Link</a><br />
-Paper this was based on: <a href="http://richard.myweb.cs.uwindsor.ca/PUBLICATIONS/PREPRINT_PADL_NOV_07.pdf">Link</a></p>
+Paper this was based on: <a href="http://richard.myweb.cs.uwindsor.ca/PUBLICATIONS/PREPRINT_PADL_NOV_07.pdf" class="external">Link</a></p>
<h5>2/2/2021</h5>
@@ -21,7 +21,9 @@ Paper this was based on: <a href="http://richard.myweb.cs.uwindsor.ca/PUBLICATIO
<h5>Overview</h5>
<p>Parser combinators are what you end up with when you start factoring out common pieces of
-functionality from <a href="http://www.engr.mun.ca/~theo/Misc/exp_parsing.htm">recursive descent parsing</a>. They are higher order functions that can be combined in modular ways to create a desired parser.</p>
+functionality from <a href="http://www.engr.mun.ca/~theo/Misc/exp_parsing.htm" class="external">
+recursive descent parsing</a>. They are higher order functions that can be combined in modular ways
+to create a desired parser.</p>
<p>However they also inherit the drawbacks of recursive descent parsing, and in particular recursive
descent parsing with backtracking. If the grammar that the parser is designed to accept contains
@@ -90,8 +92,10 @@ provide a good general impression.</p>
<p>More thorough documentation is provided in the <em>/doc</em> directory.</p>
-<p>The name of the library comes from <a href="https://bford.info/pub/lang/packrat-icfp02.pdf">packrat parsing</a> which is a parsing algorithm that avoids exponential time complexity by memoizing all intermediate results. As that is what this library does, both so as to reduce the time complexity
-and to enable piecewise parsing, the name seemed appropriate.</p>
+<p>The name of the library comes from <a href="https://bford.info/pub/lang/packrat-icfp02.pdf"
+class="external">packrat parsing</a> which is a parsing algorithm that avoids exponential time
+complexity by memoizing all intermediate results. As that is what this library does, both so as to
+reduce the time complexity and to enable piecewise parsing, the name seemed appropriate.</p>
<h5>Left Recursion</h5>