1447984 - [BinAST] Investigate generating a shorter BinAST parser

Status: RESOLVED INCOMPLETE

(Core :: JavaScript Engine, enhancement, P3)

Description

[David Teller [:Yoric] - still alive but not very active]

The current BinAST parser is ~10kloc long. We could also generate a parser with less code (and more data) along the lines of

class ShortBinASTParser {
  JS::Result<ParseNode*> parseSum(&Sum);
  JS::Result<ParseNode*> parseInterface(&Interface);
  JS::Result<ParseNode*> parseOption(&Option);
  JS::Result<ParseNode*> parseEnum(&Enum);
};

Where:
* an instance of `Sum` is a mapping from BinKind => Interface (plus an optional function pointer for verification and/or building);
* an instance of `Sum` is a BinKind and a list of field types, plus a function pointer for verification and building;
* ...

This would produce a smaller binary, which might (or might not) fit better in the cache.