Preserve file structure through initial check

Insert $file_start and $file_end pragmas in the AST, as well as
$include_start and $include_end pragmas so we can reconstruct the
original file structure later if needed, provided nothing like
topological sorting has been done.

Have the Lexer produce a list of comments whenever it parses a file,
which can the be attached to the nearest nodes in the abstract syntax
tree.

1 files changed, 1 insertions, 1 deletions

diff --git a/src/parse_ast.ml b/src/parse_ast.ml
index 6cb3f84d..c7b01ba5 100644
--- a/src/parse_ast.ml
+++ b/src/parse_ast.ml
@@ -531,4 +531,4 @@ and lexp =
 
 type 
 defs =  (* Definition sequence *)
-   Defs of (def) list
+   Defs of (string * def list) list