note Anonymous Monk <p> Correctly parsing a Haskell file requires parsing its dependencies, but it doesn't require <em>running</em> any Haskell code, since infix declarations are quite static. </p> <p> What it does mean is that to parse Haskell, you need to figure out the imports and infix declarations before actually parsing expressions. That's not very hard to do. You could, for example, initially parse expressions just into either lists of identifiers or rose trees regardless of precedence. Once you have the AST for a source file, it's easy to see the declarations that you need, and then use the information to fix up the expressions based on precedence. </p> 663393 663651 1