Liquidsoap_lang_parser.Term_preprocessorParsed-term level preprocessing: %include expansion.
type processor =
(Parser.token * Stdlib.Lexing.position * Stdlib.Lexing.position,
Liquidsoap_lang_ast.Parsed_term.t)
MenhirLib.Convert.revisedval program :
(Parser.token * Stdlib.Lexing.position * Stdlib.Lexing.position,
Liquidsoap_lang_ast.Parsed_term.t)
MenhirLib__Convert.revisedval script_path_binding :
filename:Liquidsoap_lang_ast.Parsed_term.parsed_ast ->
pos:Parser_helper.pos ->
Liquidsoap_lang_ast.Parsed_term.statementval let_script_path :
filename:Liquidsoap_lang_ast.Parsed_term.parsed_ast ->
Liquidsoap_lang_ast.Parsed_term.t ->
Liquidsoap_lang_ast.Parsed_term.tval mk_expr :
?fname:??? ->
(Parser.token * Stdlib.Lexing.position * Stdlib.Lexing.position,
Liquidsoap_lang_ast.Parsed_term.t)
MenhirLib__Convert.revised ->
Sedlexing.lexbuf ->
Liquidsoap_lang_ast.Parsed_term.tval includer_reducer :
pos:Liquidsoap_lang_ast.Parsed_term.pos ->
[< `Include of Liquidsoap_lang_ast.Parsed_term.inc ] ->
Liquidsoap_lang_ast.Parsed_term.tval included_statements :
pos:Liquidsoap_lang_ast.Parsed_term.pos ->
[< `Include of Liquidsoap_lang_ast.Parsed_term.inc ] ->
Liquidsoap_lang_ast.Parsed_term.statement listval expand_term :
Liquidsoap_lang_ast.Parsed_term.t ->
Liquidsoap_lang_ast.Parsed_term.tExpand every `%include` in tm and normalize `Inline_if` into `If`. Everything else is left alone: the recursion over the other constructors is Parsed_term.map_children, with the block hook doing the splicing.
val expand_block :
Liquidsoap_lang_ast.Parsed_term.block ->
Liquidsoap_lang_ast.Parsed_term.blockval expand_statements :
restore_script_path:bool ->
Liquidsoap_lang_ast.Parsed_term.statement list ->
Liquidsoap_lang_ast.Parsed_term.statement listval expand_statement :
restore_script_path:bool ->
Liquidsoap_lang_ast.Parsed_term.statement ->
Liquidsoap_lang_ast.Parsed_term.statement list