Paper: Parsing JavaScript by counting character pairs

gaz Heyes gazheyes at gmail.com
Wed Jan 16 05:05:40 PST 2013


On 16 January 2013 12:58, Sam Tobin-Hochstadt <samth at ccs.neu.edu> wrote:

> This sounds similar in the abstract to the way Lisp systems work, with
> a "reader" that comes before parsing and builds a simple structure
> based on (), "", and []. This has been implemented in JS by Tim Disney
> for his sweet.js project [1], but I don't think they have parsing
> speed in mind there.
>

Sorta similar but the read step occurs real time and the counts of each
pair are used as a reference.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.mozilla.org/pipermail/es-discuss/attachments/20130116/d0cd5843/attachment.html>


More information about the es-discuss mailing list