Just out of interest (I worked on a table-driven parser for SML a couple of deca... | Hacker News

Hacker News new | past | comments | ask | show | jobs | submit

login

user2994cb on April 2, 2018 | parent | context | favorite | on: MLton Compiler Overview

Just out of interest (I worked on a table-driven parser for SML a couple of decades ago) - what bits of ML syntax is giving you trouble? I remember one bit that (theoretically) needed unbounded lookahead, and user-defined infix operators were fun.

rwmj on April 3, 2018 [–]

There's a difficult problem with precedence and unary operators. For example:

    set_field !list_end 1 cons

cannot be parsed. Anyway since then I rewrote the lexer to work like the sibling comment and I'm still getting that working.

Join us for AI Startup School this June 16-17 in San Francisco!
Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact