author | Alan Dipert
<alan@dipert.org> 2020-02-20 23:29:40 UTC |
committer | Alan Dipert
<alan@dipert.org> 2020-02-20 23:29:40 UTC |
parent | 4efdca1253676f5074687a0251607dd86099d2d8 |
paper/jacl-els-2020.tex | +3 | -3 |
diff --git a/paper/jacl-els-2020.tex b/paper/jacl-els-2020.tex index 9bd0d38..566d995 100644 --- a/paper/jacl-els-2020.tex +++ b/paper/jacl-els-2020.tex @@ -203,9 +203,9 @@ Syntax Trees (AST), is where the implementation of Lisp's special forms in terms of JavaScript language constructs and runtime support is performed. This is done in a single pass in which macro expansion, lexical analysis, and JavaScript AST generation all occur. The lexical -environment is maintained in a special\footnote{Special in the Lisp - sense; it has dynamic scope.} variable as the compiler descends into -Lisp code and produces JavaScript AST. +environment is maintained in a \emph{special}\footnote{Special in the + Lisp sense; it has dynamic scope.} variable as the compiler descends +into Lisp code and produces JavaScript AST. Code for \texttt{TAGBODY} is generated in the first stage, and the generated code is much slower than comparable JavaScript code for