module I = Parser0.MenhirInterpretermodule RL = RepeatableLexertype token_pos =
Parser0.token * Stdlib.Lexing.position * Stdlib.Lexing.positiontype lexer_state = Parser0.token RL.statetype 'a result = 'a Error.resultval toks : Parser0.token -> stringval is_eof : Parser0.token -> boolval _min_err :
Error.error_desc AST.annotated ->
Error.error_desc AST.annotated ->
Error.error_desc AST.annotatedval try_in_order :
(lexer_state -> Parser0.token -> AST.t) ->
Parser0.token RL.state ->
Parser0.token list ->
AST.tval loop :
Parser0.token RL.state ->
(Stdlib.Lexing.position * AST.position) ->
AST.t I.checkpoint ->
AST.tMain loop of the interpreter. Inspired by menhir documentation.
val continue :
AST.t I.checkpoint ->
(Stdlib.Lexing.position * Stdlib.Lexing.position) ->
lexer_state ->
Parser0.token ->
AST.tContinuation for try_in_order
val parse_repeatable :
(Stdlib.Lexing.position -> AST.t I.checkpoint) ->
Parser0.token RL.state ->
Stdlib.Lexing.lexbuf ->
AST.tAlternative entry-point for this module. This one take directly a repeatableLexer.
val ast_chunk : Stdlib.Lexing.lexbuf -> AST.tThe main entry-point for this module. Should be usable as a drop-in replacement for Parser0.ast.
val ast :
(Stdlib.Lexing.lexbuf -> Parser0.token) ->
Stdlib.Lexing.lexbuf ->
AST.tval opn :
(Stdlib.Lexing.lexbuf -> Parser0.token) ->
Stdlib.Lexing.lexbuf ->
AST.t