parser.ml 50 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528
  1. (*
  2. * Copyright (C)2005-2013 Haxe Foundation
  3. *
  4. * Permission is hereby granted, free of charge, to any person obtaining a
  5. * copy of this software and associated documentation files (the "Software"),
  6. * to deal in the Software without restriction, including without limitation
  7. * the rights to use, copy, modify, merge, publish, distribute, sublicense,
  8. * and/or sell copies of the Software, and to permit persons to whom the
  9. * Software is furnished to do so, subject to the following conditions:
  10. *
  11. * The above copyright notice and this permission notice shall be included in
  12. * all copies or substantial portions of the Software.
  13. *
  14. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  15. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  16. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  17. * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  18. * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
  19. * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
  20. * DEALINGS IN THE SOFTWARE.
  21. *)
  22. open Ast
  23. type error_msg =
  24. | Unexpected of token
  25. | Duplicate_default
  26. | Missing_semicolon
  27. | Unclosed_macro
  28. | Unimplemented
  29. | Missing_type
  30. | Custom of string
  31. exception Error of error_msg * pos
  32. exception TypePath of string list * (string * bool) option
  33. exception Display of expr
  34. let error_msg = function
  35. | Unexpected t -> "Unexpected "^(s_token t)
  36. | Duplicate_default -> "Duplicate default"
  37. | Missing_semicolon -> "Missing ;"
  38. | Unclosed_macro -> "Unclosed macro"
  39. | Unimplemented -> "Not implemented for current platform"
  40. | Missing_type -> "Missing type declaration"
  41. | Custom s -> s
  42. let error m p = raise (Error (m,p))
  43. let display_error : (error_msg -> pos -> unit) ref = ref (fun _ _ -> assert false)
  44. let quoted_ident_prefix = "@$__hx__"
  45. let quote_ident s =
  46. try
  47. for i = 0 to String.length s - 1 do
  48. match String.unsafe_get s i with
  49. | 'a'..'z' | 'A'..'Z' | '_' -> ()
  50. | '0'..'9' when i > 0 -> ()
  51. | _ -> raise Exit
  52. done;
  53. if Hashtbl.mem Lexer.keywords s then raise Exit;
  54. s
  55. with Exit ->
  56. quoted_ident_prefix ^ s
  57. let unquote_ident f =
  58. let pf = quoted_ident_prefix in
  59. let pflen = String.length pf in
  60. if String.length f >= pflen && String.sub f 0 pflen = pf then String.sub f pflen (String.length f - pflen), false else f, true
  61. let cache = ref (DynArray.create())
  62. let last_doc = ref None
  63. let use_doc = ref false
  64. let resume_display = ref null_pos
  65. let in_macro = ref false
  66. let last_token s =
  67. let n = Stream.count s in
  68. DynArray.get (!cache) (if n = 0 then 0 else n - 1)
  69. let serror() = raise (Stream.Error "")
  70. let do_resume() = !resume_display <> null_pos
  71. let display e = raise (Display e)
  72. let is_resuming p =
  73. let p2 = !resume_display in
  74. p.pmax = p2.pmin && Common.unique_full_path p.pfile = p2.pfile
  75. let set_resume p =
  76. resume_display := { p with pfile = Common.unique_full_path p.pfile }
  77. let is_dollar_ident e = match fst e with
  78. | EConst (Ident n) when n.[0] = '$' ->
  79. true
  80. | _ ->
  81. false
  82. let precedence op =
  83. let left = true and right = false in
  84. match op with
  85. | OpMod -> 0, left
  86. | OpMult | OpDiv -> 1, left
  87. | OpAdd | OpSub -> 2, left
  88. | OpShl | OpShr | OpUShr -> 3, left
  89. | OpOr | OpAnd | OpXor -> 4, left
  90. | OpEq | OpNotEq | OpGt | OpLt | OpGte | OpLte -> 5, left
  91. | OpInterval -> 6, left
  92. | OpBoolAnd -> 7, left
  93. | OpBoolOr -> 8, left
  94. | OpArrow -> 9, right
  95. | OpAssign | OpAssignOp _ -> 10, right
  96. let is_not_assign = function
  97. | OpAssign | OpAssignOp _ -> false
  98. | _ -> true
  99. let swap op1 op2 =
  100. let p1, left1 = precedence op1 in
  101. let p2, _ = precedence op2 in
  102. left1 && p1 <= p2
  103. let rec make_binop op e ((v,p2) as e2) =
  104. match v with
  105. | EBinop (_op,_e,_e2) when swap op _op ->
  106. let _e = make_binop op e _e in
  107. EBinop (_op,_e,_e2) , punion (pos _e) (pos _e2)
  108. | ETernary (e1,e2,e3) when is_not_assign op ->
  109. let e = make_binop op e e1 in
  110. ETernary (e,e2,e3) , punion (pos e) (pos e3)
  111. | _ ->
  112. EBinop (op,e,e2) , punion (pos e) (pos e2)
  113. let rec make_unop op ((v,p2) as e) p1 =
  114. match v with
  115. | EBinop (bop,e,e2) -> EBinop (bop, make_unop op e p1 , e2) , (punion p1 p2)
  116. | ETernary (e1,e2,e3) -> ETernary (make_unop op e1 p1 , e2, e3), punion p1 p2
  117. | _ ->
  118. EUnop (op,Prefix,e), punion p1 p2
  119. let rec make_meta name params ((v,p2) as e) p1 =
  120. match v with
  121. | EBinop (bop,e,e2) -> EBinop (bop, make_meta name params e p1 , e2) , (punion p1 p2)
  122. | ETernary (e1,e2,e3) -> ETernary (make_meta name params e1 p1 , e2, e3), punion p1 p2
  123. | _ ->
  124. EMeta((name,params,p1),e),punion p1 p2
  125. let reify in_macro =
  126. let cur_pos = ref None in
  127. let mk_enum ename n vl p =
  128. let constr = (EConst (Ident n),p) in
  129. match vl with
  130. | [] -> constr
  131. | _ -> (ECall (constr,vl),p)
  132. in
  133. let to_const c p =
  134. let cst n v = mk_enum "Constant" n [EConst (String v),p] p in
  135. match c with
  136. | Int i -> cst "CInt" i
  137. | String s -> cst "CString" s
  138. | Float s -> cst "CFloat" s
  139. | Ident s -> cst "CIdent" s
  140. | Regexp (r,o) -> mk_enum "Constant" "CRegexp" [(EConst (String r),p);(EConst (String o),p)] p
  141. in
  142. let rec to_binop o p =
  143. let op n = mk_enum "Binop" n [] p in
  144. match o with
  145. | OpAdd -> op "OpAdd"
  146. | OpMult -> op "OpMult"
  147. | OpDiv -> op "OpDiv"
  148. | OpSub -> op "OpSub"
  149. | OpAssign -> op "OpAssign"
  150. | OpEq -> op "OpEq"
  151. | OpNotEq -> op "OpNotEq"
  152. | OpGt -> op "OpGt"
  153. | OpGte -> op "OpGte"
  154. | OpLt -> op "OpLt"
  155. | OpLte -> op "OpLte"
  156. | OpAnd -> op "OpAnd"
  157. | OpOr -> op "OpOr"
  158. | OpXor -> op "OpXor"
  159. | OpBoolAnd -> op "OpBoolAnd"
  160. | OpBoolOr -> op "OpBoolOr"
  161. | OpShl -> op "OpShl"
  162. | OpShr -> op "OpShr"
  163. | OpUShr -> op "OpUShr"
  164. | OpMod -> op "OpMod"
  165. | OpAssignOp o -> mk_enum "Binop" "OpAssignOp" [to_binop o p] p
  166. | OpInterval -> op "OpInterval"
  167. | OpArrow -> op "OpArrow"
  168. in
  169. let to_string s p =
  170. let len = String.length s in
  171. if len > 1 && s.[0] = '$' then
  172. (EConst (Ident (String.sub s 1 (len - 1))),p)
  173. else
  174. (EConst (String s),p)
  175. in
  176. let to_array f a p =
  177. (EArrayDecl (List.map (fun s -> f s p) a),p)
  178. in
  179. let to_null p =
  180. (EConst (Ident "null"),p)
  181. in
  182. let to_opt f v p =
  183. match v with
  184. | None -> to_null p
  185. | Some v -> f v p
  186. in
  187. let to_bool o p =
  188. (EConst (Ident (if o then "true" else "false")),p)
  189. in
  190. let to_obj fields p =
  191. (EObjectDecl fields,p)
  192. in
  193. let rec to_tparam t p =
  194. let n, v = (match t with
  195. | TPType t -> "TPType", to_ctype t p
  196. | TPExpr e -> "TPExpr", to_expr e p
  197. ) in
  198. mk_enum "TypeParam" n [v] p
  199. and to_tpath t p =
  200. let len = String.length t.tname in
  201. if t.tpackage = [] && len > 1 && t.tname.[0] = '$' then
  202. (EConst (Ident (String.sub t.tname 1 (len - 1))),p)
  203. else begin
  204. let fields = [
  205. ("pack", to_array to_string t.tpackage p);
  206. ("name", to_string t.tname p);
  207. ("params", to_array to_tparam t.tparams p);
  208. ] in
  209. to_obj (match t.tsub with None -> fields | Some s -> fields @ ["sub",to_string s p]) p
  210. end
  211. and to_ctype t p =
  212. let ct n vl = mk_enum "ComplexType" n vl p in
  213. match t with
  214. | CTPath { tpackage = []; tparams = []; tsub = None; tname = n } when n.[0] = '$' ->
  215. to_string n p
  216. | CTPath t -> ct "TPath" [to_tpath t p]
  217. | CTFunction (args,ret) -> ct "TFunction" [to_array to_ctype args p; to_ctype ret p]
  218. | CTAnonymous fields -> ct "TAnonymous" [to_array to_cfield fields p]
  219. | CTParent t -> ct "TParent" [to_ctype t p]
  220. | CTExtend (tl,fields) -> ct "TExtend" [to_array to_tpath tl p; to_array to_cfield fields p]
  221. | CTOptional t -> ct "TOptional" [to_ctype t p]
  222. and to_fun f p =
  223. let farg (n,o,t,e) p =
  224. let fields = [
  225. "name", to_string n p;
  226. "opt", to_bool o p;
  227. "type", to_opt to_ctype t p;
  228. ] in
  229. to_obj (match e with None -> fields | Some e -> fields @ ["value",to_expr e p]) p
  230. in
  231. let rec fparam t p =
  232. let fields = [
  233. "name", to_string t.tp_name p;
  234. "constraints", to_array to_ctype t.tp_constraints p;
  235. "params", to_array fparam t.tp_params p;
  236. ] in
  237. to_obj fields p
  238. in
  239. let fields = [
  240. ("args",to_array farg f.f_args p);
  241. ("ret",to_opt to_ctype f.f_type p);
  242. ("expr",to_opt to_expr f.f_expr p);
  243. ("params",to_array fparam f.f_params p);
  244. ] in
  245. to_obj fields p
  246. and to_cfield f p =
  247. let p = f.cff_pos in
  248. let to_access a p =
  249. let n = (match a with
  250. | APublic -> "APublic"
  251. | APrivate -> "APrivate"
  252. | AStatic -> "AStatic"
  253. | AOverride -> "AOverride"
  254. | ADynamic -> "ADynamic"
  255. | AInline -> "AInline"
  256. | AMacro -> "AMacro"
  257. ) in
  258. mk_enum "Access" n [] p
  259. in
  260. let to_kind k =
  261. let n, vl = (match k with
  262. | FVar (ct,e) -> "FVar", [to_opt to_ctype ct p;to_opt to_expr e p]
  263. | FFun f -> "FFun", [to_fun f p]
  264. | FProp (get,set,t,e) -> "FProp", [to_string get p; to_string set p; to_opt to_ctype t p; to_opt to_expr e p]
  265. ) in
  266. mk_enum "FieldType" n vl p
  267. in
  268. let fields = [
  269. Some ("name", to_string f.cff_name p);
  270. (match f.cff_doc with None -> None | Some s -> Some ("doc", to_string s p));
  271. (match f.cff_access with [] -> None | l -> Some ("access", to_array to_access l p));
  272. Some ("kind", to_kind f.cff_kind);
  273. Some ("pos", to_pos f.cff_pos);
  274. (match f.cff_meta with [] -> None | l -> Some ("meta", to_meta f.cff_meta p));
  275. ] in
  276. let fields = List.rev (List.fold_left (fun acc v -> match v with None -> acc | Some e -> e :: acc) [] fields) in
  277. to_obj fields p
  278. and to_meta m p =
  279. to_array (fun (m,el,p) _ ->
  280. let fields = [
  281. "name", to_string (fst (Common.MetaInfo.to_string m)) p;
  282. "params", to_expr_array el p;
  283. "pos", to_pos p;
  284. ] in
  285. to_obj fields p
  286. ) m p
  287. and to_pos p =
  288. match !cur_pos with
  289. | Some p ->
  290. p
  291. | None ->
  292. let file = (EConst (String p.pfile),p) in
  293. let pmin = (EConst (Int (string_of_int p.pmin)),p) in
  294. let pmax = (EConst (Int (string_of_int p.pmax)),p) in
  295. if in_macro then
  296. (EUntyped (ECall ((EConst (Ident "__dollar__mk_pos"),p),[file;pmin;pmax]),p),p)
  297. else
  298. to_obj [("file",file);("min",pmin);("max",pmax)] p
  299. and to_expr_array a p = match a with
  300. | [EMeta ((Meta.Dollar "a",[],_),e1),_] -> (match fst e1 with EArrayDecl el -> to_expr_array el p | _ -> e1)
  301. | _ -> to_array to_expr a p
  302. and to_expr e _ =
  303. let p = snd e in
  304. let expr n vl =
  305. let e = mk_enum "ExprDef" n vl p in
  306. to_obj [("expr",e);("pos",to_pos p)] p
  307. in
  308. let loop e = to_expr e (snd e) in
  309. match fst e with
  310. | EConst (Ident n) when n.[0] = '$' && String.length n > 1 ->
  311. to_string n p
  312. | EConst c ->
  313. expr "EConst" [to_const c p]
  314. | EArray (e1,e2) ->
  315. expr "EArray" [loop e1;loop e2]
  316. | EBinop (op,e1,e2) ->
  317. expr "EBinop" [to_binop op p; loop e1; loop e2]
  318. | EField (e,s) ->
  319. expr "EField" [loop e; to_string s p]
  320. | EParenthesis e ->
  321. expr "EParenthesis" [loop e]
  322. | EObjectDecl fl ->
  323. expr "EObjectDecl" [to_array (fun (f,e) -> to_obj [("field",to_string f p);("expr",loop e)]) fl p]
  324. | EArrayDecl el ->
  325. expr "EArrayDecl" [to_expr_array el p]
  326. | ECall (e,el) ->
  327. expr "ECall" [loop e;to_expr_array el p]
  328. | ENew (t,el) ->
  329. expr "ENew" [to_tpath t p;to_expr_array el p]
  330. | EUnop (op,flag,e) ->
  331. let op = mk_enum "Unop" (match op with
  332. | Increment -> "OpIncrement"
  333. | Decrement -> "OpDecrement"
  334. | Not -> "OpNot"
  335. | Neg -> "OpNeg"
  336. | NegBits -> "OpNegBits"
  337. ) [] p in
  338. expr "EUnop" [op;to_bool (flag = Postfix) p;loop e]
  339. | EVars vl ->
  340. expr "EVars" [to_array (fun (v,t,e) p ->
  341. let fields = [
  342. "name", to_string v p;
  343. "type", to_opt to_ctype t p;
  344. "expr", to_opt to_expr e p;
  345. ] in
  346. to_obj fields p
  347. ) vl p]
  348. | EFunction (name,f) ->
  349. expr "EFunction" [to_opt to_string name p; to_fun f p]
  350. | EBlock el ->
  351. expr "EBlock" [to_expr_array el p]
  352. | EFor (e1,e2) ->
  353. expr "EFor" [loop e1;loop e2]
  354. | EIn (e1,e2) ->
  355. expr "EIn" [loop e1;loop e2]
  356. | EIf (e1,e2,eelse) ->
  357. expr "EIf" [loop e1;loop e2;to_opt to_expr eelse p]
  358. | EWhile (e1,e2,flag) ->
  359. expr "EWhile" [loop e1;loop e2;to_bool (flag = NormalWhile) p]
  360. | ESwitch (e1,cases,def) ->
  361. let scase (el,eg,e) p =
  362. to_obj [("values",to_expr_array el p);"guard",to_opt to_expr eg p;"expr",to_opt to_expr e p] p
  363. in
  364. expr "ESwitch" [loop e1;to_array scase cases p;to_opt (to_opt to_expr) def p]
  365. | ETry (e1,catches) ->
  366. let scatch (n,t,e) p =
  367. to_obj [("name",to_string n p);("type",to_ctype t p);("expr",loop e)] p
  368. in
  369. expr "ETry" [loop e1;to_array scatch catches p]
  370. | EReturn eo ->
  371. expr "EReturn" [to_opt to_expr eo p]
  372. | EBreak ->
  373. expr "EBreak" []
  374. | EContinue ->
  375. expr "EContinue" []
  376. | EUntyped e ->
  377. expr "EUntyped" [loop e]
  378. | EThrow e ->
  379. expr "EThrow" [loop e]
  380. | ECast (e,ct) ->
  381. expr "ECast" [loop e; to_opt to_ctype ct p]
  382. | EDisplay (e,flag) ->
  383. expr "EDisplay" [loop e; to_bool flag p]
  384. | EDisplayNew t ->
  385. expr "EDisplayNew" [to_tpath t p]
  386. | ETernary (e1,e2,e3) ->
  387. expr "ETernary" [loop e1;loop e2;loop e3]
  388. | ECheckType (e1,ct) ->
  389. expr "ECheckType" [loop e1; to_ctype ct p]
  390. | EMeta ((m,ml,p),e1) ->
  391. match m, ml with
  392. | Meta.Dollar ("" | "e"), _ ->
  393. e1
  394. | Meta.Dollar "a", _ ->
  395. expr "EArrayDecl" (match fst e1 with EArrayDecl el -> [to_expr_array el p] | _ -> [e1])
  396. | Meta.Dollar "b", _ ->
  397. expr "EBlock" [e1]
  398. (* TODO: can $v and $i be implemented better? *)
  399. | Meta.Dollar "v", _ ->
  400. begin match fst e1 with
  401. | EParenthesis (ECheckType (e2, CTPath{tname="String";tpackage=[]}),_) -> expr "EConst" [mk_enum "Constant" "CString" [e2] (pos e2)]
  402. | EParenthesis (ECheckType (e2, CTPath{tname="Int";tpackage=[]}),_) -> expr "EConst" [mk_enum "Constant" "CInt" [e2] (pos e2)]
  403. | EParenthesis (ECheckType (e2, CTPath{tname="Float";tpackage=[]}),_) -> expr "EConst" [mk_enum "Constant" "CFloat" [e2] (pos e2)]
  404. | _ -> (ECall ((EField ((EField ((EField ((EConst (Ident "haxe"),p),"macro"),p),"Context"),p),"makeExpr"),p),[e; to_pos (pos e)]),p)
  405. end
  406. | Meta.Dollar "i", _ ->
  407. expr "EConst" [mk_enum "Constant" "CIdent" [e1] (pos e1)]
  408. | Meta.Dollar "p", _ ->
  409. (ECall ((EField ((EField ((EField ((EConst (Ident "haxe"),p),"macro"),p),"MacroStringTools"),p),"toFieldExpr"),p),[e]),p)
  410. | Meta.Custom ":pos", [pexpr] ->
  411. let old = !cur_pos in
  412. cur_pos := Some pexpr;
  413. let e = loop e1 in
  414. cur_pos := old;
  415. e
  416. | _ ->
  417. expr "EMeta" [to_obj [("name",to_string (fst (Common.MetaInfo.to_string m)) p);("params",to_expr_array ml p);("pos",to_pos p)] p;loop e1]
  418. and to_tparam_decl p t =
  419. to_obj [
  420. "name", to_string t.tp_name p;
  421. "params", (EArrayDecl (List.map (to_tparam_decl p) t.tp_params),p);
  422. "constraints", (EArrayDecl (List.map (fun t -> to_ctype t p) t.tp_constraints),p)
  423. ] p
  424. and to_type_def (t,p) =
  425. match t with
  426. | EClass d ->
  427. let ext = ref None and impl = ref [] and interf = ref false in
  428. List.iter (function
  429. | HExtern | HPrivate -> ()
  430. | HInterface -> interf := true;
  431. | HExtends t -> ext := Some (to_tpath t p)
  432. | HImplements i -> impl := (to_tpath i p) :: !impl
  433. ) d.d_flags;
  434. to_obj [
  435. "pack", (EArrayDecl [],p);
  436. "name", to_string d.d_name p;
  437. "pos", to_pos p;
  438. "meta", to_meta d.d_meta p;
  439. "params", (EArrayDecl (List.map (to_tparam_decl p) d.d_params),p);
  440. "isExtern", to_bool (List.mem HExtern d.d_flags) p;
  441. "kind", mk_enum "TypeDefKind" "TDClass" [(match !ext with None -> (EConst (Ident "null"),p) | Some t -> t);(EArrayDecl (List.rev !impl),p);to_bool !interf p] p;
  442. "fields", (EArrayDecl (List.map (fun f -> to_cfield f p) d.d_data),p)
  443. ] p
  444. | _ -> assert false
  445. in
  446. (fun e -> to_expr e (snd e)), to_ctype, to_type_def
  447. let popt f = parser
  448. | [< v = f >] -> Some v
  449. | [< >] -> None
  450. let rec plist f = parser
  451. | [< v = f; l = plist f >] -> v :: l
  452. | [< >] -> []
  453. let rec psep sep f = parser
  454. | [< v = f; s >] ->
  455. let rec loop = parser
  456. | [< '(sep2,_) when sep2 = sep; v = f; l = loop >] -> v :: l
  457. | [< >] -> []
  458. in
  459. v :: loop s
  460. | [< >] -> []
  461. let ident = parser
  462. | [< '(Const (Ident i),p) >] -> i,p
  463. let dollar_ident = parser
  464. | [< '(Const (Ident i),p) >] -> i,p
  465. | [< '(Dollar i,p) >] -> ("$" ^ i),p
  466. let dollar_ident_macro pack = parser
  467. | [< '(Const (Ident i),p) >] -> i,p
  468. | [< '(Dollar i,p) >] -> ("$" ^ i),p
  469. | [< '(Kwd Macro,p) when pack <> [] >] -> "macro", p
  470. let lower_ident_or_macro = parser
  471. | [< '(Const (Ident i),p) when is_lower_ident i >] -> i
  472. | [< '(Kwd Macro,_) >] -> "macro"
  473. let any_enum_ident = parser
  474. | [< i = ident >] -> i
  475. | [< '(Kwd k,p) when Filename.basename p.pfile = "StdTypes.hx" >] -> s_keyword k, p
  476. let property_ident = parser
  477. | [< i, _ = ident >] -> i
  478. | [< '(Kwd Dynamic,_) >] -> "dynamic"
  479. | [< '(Kwd Default,_) >] -> "default"
  480. | [< '(Kwd Null,_) >] -> "null"
  481. let get_doc s =
  482. (* do the peek first to make sure we fetch the doc *)
  483. match Stream.peek s with
  484. | None -> None
  485. | Some (tk,p) ->
  486. match !last_doc with
  487. | None -> None
  488. | Some (d,pos) ->
  489. last_doc := None;
  490. if pos = p.pmin then Some d else None
  491. let comma = parser
  492. | [< '(Comma,_) >] -> ()
  493. let semicolon s =
  494. if fst (last_token s) = BrClose then
  495. match s with parser
  496. | [< '(Semicolon,p) >] -> p
  497. | [< >] -> snd (last_token s)
  498. else
  499. match s with parser
  500. | [< '(Semicolon,p) >] -> p
  501. | [< s >] ->
  502. let pos = snd (last_token s) in
  503. if do_resume() then pos else error Missing_semicolon pos
  504. let rec parse_file s =
  505. last_doc := None;
  506. match s with parser
  507. | [< '(Kwd Package,_); pack = parse_package; s >] ->
  508. begin match s with parser
  509. | [< '(Const(Ident _),p) when pack = [] >] -> error (Custom "Package name must start with a lowercase character") p
  510. | [< _ = semicolon; l = parse_type_decls pack []; '(Eof,_) >] -> pack , l
  511. end
  512. | [< l = parse_type_decls [] []; '(Eof,_) >] -> [] , l
  513. and parse_type_decls pack acc s =
  514. try
  515. match s with parser
  516. | [< v = parse_type_decl; l = parse_type_decls pack (v :: acc) >] -> l
  517. | [< >] -> List.rev acc
  518. with TypePath ([],Some (name,false)) ->
  519. (* resolve imports *)
  520. List.iter (fun d ->
  521. match fst d with
  522. | EImport (t,_) ->
  523. (match List.rev t with
  524. | (n,_) :: path when n = name && List.for_all (fun (i,_) -> is_lower_ident i) path -> raise (TypePath (List.map fst (List.rev path),Some (name,false)))
  525. | _ -> ())
  526. | _ -> ()
  527. ) acc;
  528. raise (TypePath (pack,Some(name,true)))
  529. and parse_type_decl s =
  530. match s with parser
  531. | [< '(Kwd Import,p1) >] -> parse_import s p1
  532. | [< '(Kwd Using,p1); t = parse_type_path; p2 = semicolon >] -> EUsing t, punion p1 p2
  533. | [< doc = get_doc; meta = parse_meta; c = parse_common_flags; s >] ->
  534. match s with parser
  535. | [< n , p1 = parse_enum_flags; name = type_name; tl = parse_constraint_params; '(BrOpen,_); l = plist parse_enum; '(BrClose,p2) >] ->
  536. (EEnum {
  537. d_name = name;
  538. d_doc = doc;
  539. d_meta = meta;
  540. d_params = tl;
  541. d_flags = List.map snd c @ n;
  542. d_data = l
  543. }, punion p1 p2)
  544. | [< n , p1 = parse_class_flags; name = type_name; tl = parse_constraint_params; hl = plist parse_class_herit; '(BrOpen,_); fl, p2 = parse_class_fields false p1 >] ->
  545. (EClass {
  546. d_name = name;
  547. d_doc = doc;
  548. d_meta = meta;
  549. d_params = tl;
  550. d_flags = List.map fst c @ n @ hl;
  551. d_data = fl;
  552. }, punion p1 p2)
  553. | [< '(Kwd Typedef,p1); name = type_name; tl = parse_constraint_params; '(Binop OpAssign,p2); t = parse_complex_type; s >] ->
  554. (match s with parser
  555. | [< '(Semicolon,_) >] -> ()
  556. | [< >] -> ());
  557. (ETypedef {
  558. d_name = name;
  559. d_doc = doc;
  560. d_meta = meta;
  561. d_params = tl;
  562. d_flags = List.map snd c;
  563. d_data = t;
  564. }, punion p1 p2)
  565. | [< '(Kwd Abstract,p1); name = type_name; tl = parse_constraint_params; st = parse_abstract_subtype; sl = plist parse_abstract_relations; '(BrOpen,_); fl, p2 = parse_class_fields false p1 >] ->
  566. let flags = List.map (fun (_,c) -> match c with EPrivate -> APrivAbstract | EExtern -> error (Custom "extern abstract not allowed") p1) c in
  567. let flags = (match st with None -> flags | Some t -> AIsType t :: flags) in
  568. (EAbstract {
  569. d_name = name;
  570. d_doc = doc;
  571. d_meta = meta;
  572. d_params = tl;
  573. d_flags = flags @ sl;
  574. d_data = fl;
  575. },punion p1 p2)
  576. and parse_class doc meta cflags need_name s =
  577. let opt_name = if need_name then type_name else (fun s -> match popt type_name s with None -> "" | Some n -> n) in
  578. match s with parser
  579. | [< n , p1 = parse_class_flags; name = opt_name; tl = parse_constraint_params; hl = psep Comma parse_class_herit; '(BrOpen,_); fl, p2 = parse_class_fields (not need_name) p1 >] ->
  580. (EClass {
  581. d_name = name;
  582. d_doc = doc;
  583. d_meta = meta;
  584. d_params = tl;
  585. d_flags = List.map fst cflags @ n @ hl;
  586. d_data = fl;
  587. }, punion p1 p2)
  588. and parse_import s p1 =
  589. let rec loop acc =
  590. match s with parser
  591. | [< '(Dot,p) >] ->
  592. if is_resuming p then raise (TypePath (List.rev (List.map fst acc),None));
  593. (match s with parser
  594. | [< '(Const (Ident k),p) >] ->
  595. loop ((k,p) :: acc)
  596. | [< '(Kwd Macro,p) >] ->
  597. loop (("macro",p) :: acc)
  598. | [< '(Binop OpMult,_); '(Semicolon,p2) >] ->
  599. p2, List.rev acc, IAll
  600. | [< '(Binop OpOr,_) when do_resume() >] ->
  601. set_resume p;
  602. raise (TypePath (List.rev (List.map fst acc),None))
  603. | [< >] ->
  604. serror());
  605. | [< '(Semicolon,p2) >] ->
  606. p2, List.rev acc, INormal
  607. | [< '(Kwd In,_); '(Const (Ident name),_); '(Semicolon,p2) >] ->
  608. p2, List.rev acc, IAsName name
  609. | [< >] ->
  610. serror()
  611. in
  612. let p2, path, mode = (match s with parser
  613. | [< '(Const (Ident name),p) >] -> loop [name,p]
  614. | [< >] -> serror()
  615. ) in
  616. (EImport (path,mode),punion p1 p2)
  617. and parse_abstract_relations s =
  618. match s with parser
  619. | [< '(Const (Ident "to"),_); t = parse_complex_type >] -> AToType t
  620. | [< '(Const (Ident "from"),_); t = parse_complex_type >] -> AFromType t
  621. and parse_abstract_subtype s =
  622. match s with parser
  623. | [< '(POpen, _); t = parse_complex_type; '(PClose,_) >] -> Some t
  624. | [< >] -> None
  625. and parse_package s = psep Dot lower_ident_or_macro s
  626. and parse_class_fields tdecl p1 s =
  627. let l = parse_class_field_resume tdecl s in
  628. let p2 = (match s with parser
  629. | [< '(BrClose,p2) >] -> p2
  630. | [< >] -> if do_resume() then p1 else serror()
  631. ) in
  632. l, p2
  633. and parse_class_field_resume tdecl s =
  634. if not (do_resume()) then
  635. plist parse_class_field s
  636. else try
  637. let c = parse_class_field s in
  638. c :: parse_class_field_resume tdecl s
  639. with Stream.Error _ | Stream.Failure ->
  640. (* look for next variable/function or next type declaration *)
  641. let rec junk k =
  642. if k <= 0 then () else begin
  643. Stream.junk s;
  644. junk (k - 1);
  645. end
  646. in
  647. (*
  648. walk back tokens which are prefixing a type/field declaration
  649. *)
  650. let rec junk_tokens k =
  651. if k = 0 then
  652. ()
  653. else match List.rev_map fst (Stream.npeek k s) with
  654. | Kwd Private :: _ -> junk_tokens (k - 1)
  655. | (Const (Ident _) | Kwd _) :: DblDot :: At :: l
  656. | (Const (Ident _) | Kwd _) :: At :: l ->
  657. junk_tokens (List.length l)
  658. | PClose :: l ->
  659. (* count matching parenthesises for metadata call *)
  660. let rec loop n = function
  661. | [] -> []
  662. | POpen :: l -> if n = 0 then l else loop (n - 1) l
  663. | PClose :: l -> loop (n + 1) l
  664. | _ :: l -> loop n l
  665. in
  666. (match loop 0 l with
  667. | (Const (Ident _) | Kwd _) :: At :: l
  668. | (Const (Ident _) | Kwd _) :: DblDot :: At :: l -> junk_tokens (List.length l)
  669. | _ ->
  670. junk k)
  671. | _ ->
  672. junk k
  673. in
  674. let rec loop k =
  675. match List.rev_map fst (Stream.npeek k s) with
  676. (* metadata *)
  677. | Kwd _ :: At :: _ | Kwd _ :: DblDot :: At :: _ ->
  678. loop (k + 1)
  679. (* field declaration *)
  680. | Const _ :: Kwd Function :: _
  681. | Kwd New :: Kwd Function :: _ ->
  682. junk_tokens (k - 2);
  683. parse_class_field_resume tdecl s
  684. | Kwd Macro :: _ | Kwd Public :: _ | Kwd Static :: _ | Kwd Var :: _ | Kwd Override :: _ | Kwd Dynamic :: _ | Kwd Inline :: _ ->
  685. junk_tokens (k - 1);
  686. parse_class_field_resume tdecl s
  687. | BrClose :: _ when tdecl ->
  688. junk_tokens (k - 1);
  689. []
  690. (* type declaration *)
  691. | Eof :: _ | Kwd Import :: _ | Kwd Using :: _ | Kwd Extern :: _ | Kwd Class :: _ | Kwd Interface :: _ | Kwd Enum :: _ | Kwd Typedef :: _ | Kwd Abstract :: _->
  692. junk_tokens (k - 1);
  693. []
  694. | [] ->
  695. []
  696. | _ ->
  697. loop (k + 1)
  698. in
  699. loop 1
  700. and parse_common_flags = parser
  701. | [< '(Kwd Private,_); l = parse_common_flags >] -> (HPrivate, EPrivate) :: l
  702. | [< '(Kwd Extern,_); l = parse_common_flags >] -> (HExtern, EExtern) :: l
  703. | [< >] -> []
  704. and parse_meta_params pname s = match s with parser
  705. | [< '(POpen,p) when p.pmin = pname.pmax; params = psep Comma expr; '(PClose,_); >] -> params
  706. | [< >] -> []
  707. and parse_meta_entry = parser
  708. [< '(At,_); name,p = meta_name; params = parse_meta_params p; s >] -> (name,params,p)
  709. and parse_meta = parser
  710. | [< entry = parse_meta_entry; s >] ->
  711. entry :: parse_meta s
  712. | [< >] -> []
  713. and meta_name = parser
  714. | [< '(Const (Ident i),p) >] -> (Meta.Custom i), p
  715. | [< '(Kwd k,p) >] -> (Meta.Custom (s_keyword k)),p
  716. | [< '(DblDot,_); s >] -> match s with parser
  717. | [< '(Const (Ident i),p) >] -> (Common.MetaInfo.parse i), p
  718. | [< '(Kwd k,p) >] -> (Common.MetaInfo.parse (s_keyword k)),p
  719. and parse_enum_flags = parser
  720. | [< '(Kwd Enum,p) >] -> [] , p
  721. and parse_class_flags = parser
  722. | [< '(Kwd Class,p) >] -> [] , p
  723. | [< '(Kwd Interface,p) >] -> [HInterface] , p
  724. and parse_type_opt = parser
  725. | [< '(DblDot,_); t = parse_complex_type >] -> Some t
  726. | [< >] -> None
  727. and parse_complex_type s =
  728. let t = parse_complex_type_inner s in
  729. parse_complex_type_next t s
  730. and parse_structural_extension = parser
  731. | [< '(Binop OpGt,_); t = parse_type_path; '(Comma,_); s >] ->
  732. t
  733. and parse_complex_type_inner = parser
  734. | [< '(POpen,_); t = parse_complex_type; '(PClose,_) >] -> CTParent t
  735. | [< '(BrOpen,p1); s >] ->
  736. (match s with parser
  737. | [< l = parse_type_anonymous false >] -> CTAnonymous l
  738. | [< t = parse_structural_extension; s>] ->
  739. let tl = t :: plist parse_structural_extension s in
  740. (match s with parser
  741. | [< l = parse_type_anonymous false >] -> CTExtend (tl,l)
  742. | [< l, _ = parse_class_fields true p1 >] -> CTExtend (tl,l))
  743. | [< l, _ = parse_class_fields true p1 >] -> CTAnonymous l
  744. | [< >] -> serror())
  745. | [< '(Question,_); t = parse_complex_type_inner >] ->
  746. CTOptional t
  747. | [< t = parse_type_path >] ->
  748. CTPath t
  749. and parse_type_path s = parse_type_path1 [] s
  750. and parse_type_path1 pack = parser
  751. | [< name, p = dollar_ident_macro pack; s >] ->
  752. if is_lower_ident name then
  753. (match s with parser
  754. | [< '(Dot,p) >] ->
  755. if is_resuming p then
  756. raise (TypePath (List.rev (name :: pack),None))
  757. else
  758. parse_type_path1 (name :: pack) s
  759. | [< '(Semicolon,_) >] ->
  760. error (Custom "Type name should start with an uppercase letter") p
  761. | [< >] -> serror())
  762. else
  763. let sub = (match s with parser
  764. | [< '(Dot,p); s >] ->
  765. (if is_resuming p then
  766. raise (TypePath (List.rev pack,Some (name,false)))
  767. else match s with parser
  768. | [< '(Const (Ident name),_) when not (is_lower_ident name) >] -> Some name
  769. | [< '(Binop OpOr,_) when do_resume() >] ->
  770. set_resume p;
  771. raise (TypePath (List.rev pack,Some (name,false)))
  772. | [< >] -> serror())
  773. | [< >] -> None
  774. ) in
  775. let params = (match s with parser
  776. | [< '(Binop OpLt,_); l = psep Comma parse_type_path_or_const; '(Binop OpGt,_) >] -> l
  777. | [< >] -> []
  778. ) in
  779. {
  780. tpackage = List.rev pack;
  781. tname = name;
  782. tparams = params;
  783. tsub = sub;
  784. }
  785. | [< '(Binop OpOr,_) when do_resume() >] ->
  786. raise (TypePath (List.rev pack,None))
  787. and type_name = parser
  788. | [< '(Const (Ident name),p) >] ->
  789. if is_lower_ident name then
  790. error (Custom "Type name should start with an uppercase letter") p
  791. else
  792. name
  793. and parse_type_path_or_const = parser
  794. (* we can't allow (expr) here *)
  795. | [< '(BkOpen,p1); l = parse_array_decl; '(BkClose,p2); s >] -> TPExpr (EArrayDecl l, punion p1 p2)
  796. | [< t = parse_complex_type >] -> TPType t
  797. | [< '(Const c,p) >] -> TPExpr (EConst c,p)
  798. | [< e = expr >] -> TPExpr e
  799. | [< >] -> serror()
  800. and parse_complex_type_next t = parser
  801. | [< '(Arrow,_); t2 = parse_complex_type >] ->
  802. (match t2 with
  803. | CTFunction (args,r) ->
  804. CTFunction (t :: args,r)
  805. | _ ->
  806. CTFunction ([t] , t2))
  807. | [< >] -> t
  808. and parse_type_anonymous opt = parser
  809. | [< '(Question,_) when not opt; s >] -> parse_type_anonymous true s
  810. | [< name, p1 = ident; '(DblDot,_); t = parse_complex_type; s >] ->
  811. let next p2 acc =
  812. {
  813. cff_name = name;
  814. cff_meta = if opt then [Meta.Optional,[],p1] else [];
  815. cff_access = [];
  816. cff_doc = None;
  817. cff_kind = FVar (Some t,None);
  818. cff_pos = punion p1 p2;
  819. } :: acc
  820. in
  821. match s with parser
  822. | [< '(BrClose,p2) >] -> next p2 []
  823. | [< '(Comma,p2) >] ->
  824. (match s with parser
  825. | [< '(BrClose,_) >] -> next p2 []
  826. | [< l = parse_type_anonymous false >] -> next p2 l
  827. | [< >] -> serror());
  828. | [< >] -> serror()
  829. and parse_enum s =
  830. let doc = get_doc s in
  831. let meta = parse_meta s in
  832. match s with parser
  833. | [< name, p1 = any_enum_ident; params = parse_constraint_params; s >] ->
  834. let args = (match s with parser
  835. | [< '(POpen,_); l = psep Comma parse_enum_param; '(PClose,_) >] -> l
  836. | [< >] -> []
  837. ) in
  838. let t = (match s with parser
  839. | [< '(DblDot,_); t = parse_complex_type >] -> Some t
  840. | [< >] -> None
  841. ) in
  842. let p2 = (match s with parser
  843. | [< p = semicolon >] -> p
  844. | [< >] -> serror()
  845. ) in
  846. {
  847. ec_name = name;
  848. ec_doc = doc;
  849. ec_meta = meta;
  850. ec_args = args;
  851. ec_params = params;
  852. ec_type = t;
  853. ec_pos = punion p1 p2;
  854. }
  855. and parse_enum_param = parser
  856. | [< '(Question,_); name, _ = ident; '(DblDot,_); t = parse_complex_type >] -> (name,true,t)
  857. | [< name, _ = ident; '(DblDot,_); t = parse_complex_type >] -> (name,false,t)
  858. and parse_class_field s =
  859. let doc = get_doc s in
  860. match s with parser
  861. | [< meta = parse_meta; al = parse_cf_rights true []; s >] ->
  862. let name, pos, k = (match s with parser
  863. | [< '(Kwd Var,p1); name, _ = dollar_ident; s >] ->
  864. (match s with parser
  865. | [< '(POpen,_); i1 = property_ident; '(Comma,_); i2 = property_ident; '(PClose,_) >] ->
  866. let t = (match s with parser
  867. | [< '(DblDot,_); t = parse_complex_type >] -> Some t
  868. | [< >] -> None
  869. ) in
  870. let e , p2 = (match s with parser
  871. | [< '(Binop OpAssign,_); e = toplevel_expr; p2 = semicolon >] -> Some e , p2
  872. | [< '(Semicolon,p2) >] -> None , p2
  873. | [< >] -> serror()
  874. ) in
  875. name, punion p1 p2, FProp (i1,i2,t, e)
  876. | [< t = parse_type_opt; s >] ->
  877. let e , p2 = (match s with parser
  878. | [< '(Binop OpAssign,_); e = toplevel_expr; p2 = semicolon >] -> Some e , p2
  879. | [< '(Semicolon,p2) >] -> None , p2
  880. | [< >] -> serror()
  881. ) in
  882. name, punion p1 p2, FVar (t,e))
  883. | [< '(Kwd Function,p1); name = parse_fun_name; pl = parse_constraint_params; '(POpen,_); al = psep Comma parse_fun_param; '(PClose,_); t = parse_type_opt; s >] ->
  884. let e, p2 = (match s with parser
  885. | [< e = toplevel_expr; s >] ->
  886. (try ignore(semicolon s) with Error (Missing_semicolon,p) -> !display_error Missing_semicolon p);
  887. Some e, pos e
  888. | [< '(Semicolon,p) >] -> None, p
  889. | [< >] -> serror()
  890. ) in
  891. let f = {
  892. f_params = pl;
  893. f_args = al;
  894. f_type = t;
  895. f_expr = e;
  896. } in
  897. name, punion p1 p2, FFun f
  898. | [< >] ->
  899. if al = [] then raise Stream.Failure else serror()
  900. ) in
  901. {
  902. cff_name = name;
  903. cff_doc = doc;
  904. cff_meta = meta;
  905. cff_access = al;
  906. cff_pos = pos;
  907. cff_kind = k;
  908. }
  909. and parse_cf_rights allow_static l = parser
  910. | [< '(Kwd Static,_) when allow_static; l = parse_cf_rights false (AStatic :: l) >] -> l
  911. | [< '(Kwd Macro,_) when not(List.mem AMacro l); l = parse_cf_rights allow_static (AMacro :: l) >] -> l
  912. | [< '(Kwd Public,_) when not(List.mem APublic l || List.mem APrivate l); l = parse_cf_rights allow_static (APublic :: l) >] -> l
  913. | [< '(Kwd Private,_) when not(List.mem APublic l || List.mem APrivate l); l = parse_cf_rights allow_static (APrivate :: l) >] -> l
  914. | [< '(Kwd Override,_) when not (List.mem AOverride l); l = parse_cf_rights false (AOverride :: l) >] -> l
  915. | [< '(Kwd Dynamic,_) when not (List.mem ADynamic l); l = parse_cf_rights allow_static (ADynamic :: l) >] -> l
  916. | [< '(Kwd Inline,_); l = parse_cf_rights allow_static (AInline :: l) >] -> l
  917. | [< >] -> l
  918. and parse_fun_name = parser
  919. | [< name,_ = dollar_ident >] -> name
  920. | [< '(Kwd New,_) >] -> "new"
  921. and parse_fun_param = parser
  922. | [< '(Question,_); name, _ = dollar_ident; t = parse_type_opt; c = parse_fun_param_value >] -> (name,true,t,c)
  923. | [< name, _ = dollar_ident; t = parse_type_opt; c = parse_fun_param_value >] -> (name,false,t,c)
  924. and parse_fun_param_value = parser
  925. | [< '(Binop OpAssign,_); e = toplevel_expr >] -> Some e
  926. | [< >] -> None
  927. and parse_fun_param_type = parser
  928. | [< '(Question,_); name = ident; '(DblDot,_); t = parse_complex_type >] -> (name,true,t)
  929. | [< name = ident; '(DblDot,_); t = parse_complex_type >] -> (name,false,t)
  930. and parse_constraint_params = parser
  931. | [< '(Binop OpLt,_); l = psep Comma parse_constraint_param; '(Binop OpGt,_) >] -> l
  932. | [< >] -> []
  933. and parse_constraint_param = parser
  934. | [< name = type_name; s >] ->
  935. let params = (match s with parser
  936. | [< >] -> []
  937. ) in
  938. let ctl = (match s with parser
  939. | [< '(DblDot,_); s >] ->
  940. (match s with parser
  941. | [< '(POpen,_); l = psep Comma parse_complex_type; '(PClose,_) >] -> l
  942. | [< t = parse_complex_type >] -> [t]
  943. | [< >] -> serror())
  944. | [< >] -> []
  945. ) in
  946. {
  947. tp_name = name;
  948. tp_params = params;
  949. tp_constraints = ctl;
  950. }
  951. and parse_class_herit = parser
  952. | [< '(Kwd Extends,_); t = parse_type_path >] -> HExtends t
  953. | [< '(Kwd Implements,_); t = parse_type_path >] -> HImplements t
  954. and block1 = parser
  955. | [< name,p = dollar_ident; s >] -> block2 name (Ident name) p s
  956. | [< '(Const (String name),p); s >] -> block2 (quote_ident name) (String name) p s
  957. | [< b = block [] >] -> EBlock b
  958. and block2 name ident p s =
  959. match s with parser
  960. | [< '(DblDot,_); e = expr; l = parse_obj_decl >] -> EObjectDecl ((name,e) :: l)
  961. | [< >] ->
  962. let e = expr_next (EConst ident,p) s in
  963. try
  964. let _ = semicolon s in
  965. let b = block [e] s in
  966. EBlock b
  967. with
  968. | Error (err,p) ->
  969. (!display_error) err p;
  970. EBlock (block [e] s)
  971. and block acc s =
  972. try
  973. (* because of inner recursion, we can't put Display handling in errors below *)
  974. let e = try parse_block_elt s with Display e -> display (EBlock (List.rev (e :: acc)),snd e) in
  975. block (e :: acc) s
  976. with
  977. | Stream.Failure ->
  978. List.rev acc
  979. | Stream.Error _ ->
  980. let tk , pos = (match Stream.peek s with None -> last_token s | Some t -> t) in
  981. (!display_error) (Unexpected tk) pos;
  982. block acc s
  983. | Error (e,p) ->
  984. (!display_error) e p;
  985. block acc s
  986. and parse_block_elt = parser
  987. | [< '(Kwd Var,p1); vl = psep Comma parse_var_decl; p2 = semicolon >] -> (EVars vl,punion p1 p2)
  988. | [< e = expr; _ = semicolon >] -> e
  989. and parse_obj_decl = parser
  990. | [< '(Comma,_); s >] ->
  991. (match s with parser
  992. | [< name, _ = ident; '(DblDot,_); e = expr; l = parse_obj_decl >] -> (name,e) :: l
  993. | [< '(Const (String name),_); '(DblDot,_); e = expr; l = parse_obj_decl >] -> (quote_ident name,e) :: l
  994. | [< >] -> [])
  995. | [< >] -> []
  996. and parse_array_decl = parser
  997. | [< e = expr; s >] ->
  998. (match s with parser
  999. | [< '(Comma,_); l = parse_array_decl >] -> e :: l
  1000. | [< >] -> [e])
  1001. | [< >] ->
  1002. []
  1003. and parse_var_decl = parser
  1004. | [< name, _ = dollar_ident; t = parse_type_opt; s >] ->
  1005. match s with parser
  1006. | [< '(Binop OpAssign,_); e = expr >] -> (name,t,Some e)
  1007. | [< >] -> (name,t,None)
  1008. and inline_function = parser
  1009. | [< '(Kwd Inline,_); '(Kwd Function,p1) >] -> true, p1
  1010. | [< '(Kwd Function,p1) >] -> false, p1
  1011. and reify_expr e =
  1012. let to_expr,_,_ = reify !in_macro in
  1013. let e = to_expr e in
  1014. (ECheckType (e,(CTPath { tpackage = ["haxe";"macro"]; tname = "Expr"; tsub = None; tparams = [] })),pos e)
  1015. and parse_macro_expr p = parser
  1016. | [< '(DblDot,_); t = parse_complex_type >] ->
  1017. let _, to_type, _ = reify !in_macro in
  1018. let t = to_type t p in
  1019. (ECheckType (t,(CTPath { tpackage = ["haxe";"macro"]; tname = "Expr"; tsub = Some "ComplexType"; tparams = [] })),p)
  1020. | [< '(Kwd Var,p1); vl = psep Comma parse_var_decl >] ->
  1021. reify_expr (EVars vl,p1)
  1022. | [< d = parse_class None [] [] false >] ->
  1023. let _,_,to_type = reify !in_macro in
  1024. (ECheckType (to_type d,(CTPath { tpackage = ["haxe";"macro"]; tname = "Expr"; tsub = Some "TypeDefinition"; tparams = [] })),p)
  1025. | [< e = secure_expr >] ->
  1026. reify_expr e
  1027. and expr = parser
  1028. | [< (name,params,p) = parse_meta_entry; s >] ->
  1029. (try
  1030. make_meta name params (secure_expr s) p
  1031. with Display e ->
  1032. display (make_meta name params e p))
  1033. | [< '(BrOpen,p1); b = block1; '(BrClose,p2); s >] ->
  1034. let e = (b,punion p1 p2) in
  1035. (match b with
  1036. | EObjectDecl _ -> expr_next e s
  1037. | _ -> e)
  1038. | [< '(Kwd Macro,p); s >] ->
  1039. parse_macro_expr p s
  1040. | [< '(Kwd Var,p1); v = parse_var_decl >] -> (EVars [v],p1)
  1041. | [< '(Const c,p); s >] -> expr_next (EConst c,p) s
  1042. | [< '(Kwd This,p); s >] -> expr_next (EConst (Ident "this"),p) s
  1043. | [< '(Kwd True,p); s >] -> expr_next (EConst (Ident "true"),p) s
  1044. | [< '(Kwd False,p); s >] -> expr_next (EConst (Ident "false"),p) s
  1045. | [< '(Kwd Null,p); s >] -> expr_next (EConst (Ident "null"),p) s
  1046. | [< '(Kwd Cast,p1); s >] ->
  1047. (match s with parser
  1048. | [< '(POpen,_); e = expr; s >] ->
  1049. (match s with parser
  1050. | [< '(Comma,_); t = parse_complex_type; '(PClose,p2); s >] -> expr_next (ECast (e,Some t),punion p1 p2) s
  1051. | [< '(PClose,p2); s >] -> expr_next (ECast (e,None),punion p1 (pos e)) s
  1052. | [< >] -> serror())
  1053. | [< e = secure_expr >] -> expr_next (ECast (e,None),punion p1 (pos e)) s)
  1054. | [< '(Kwd Throw,p); e = expr >] -> (EThrow e,p)
  1055. | [< '(Kwd New,p1); t = parse_type_path; '(POpen,p); s >] ->
  1056. if is_resuming p then display (EDisplayNew t,punion p1 p);
  1057. (match s with parser
  1058. | [< al = psep Comma expr; '(PClose,p2); s >] -> expr_next (ENew (t,al),punion p1 p2) s
  1059. | [< >] -> serror())
  1060. | [< '(POpen,p1); e = expr; s >] -> (match s with parser
  1061. | [< '(PClose,p2); s >] -> expr_next (EParenthesis e, punion p1 p2) s
  1062. | [< '(DblDot,_); t = parse_complex_type; '(PClose,p2); s >] -> expr_next (EParenthesis (ECheckType(e,t),punion p1 p2), punion p1 p2) s)
  1063. | [< '(BkOpen,p1); l = parse_array_decl; '(BkClose,p2); s >] -> expr_next (EArrayDecl l, punion p1 p2) s
  1064. | [< inl, p1 = inline_function; name = popt dollar_ident; pl = parse_constraint_params; '(POpen,_); al = psep Comma parse_fun_param; '(PClose,_); t = parse_type_opt; s >] ->
  1065. let make e =
  1066. let f = {
  1067. f_params = pl;
  1068. f_type = t;
  1069. f_args = al;
  1070. f_expr = Some e;
  1071. } in
  1072. EFunction ((match name with None -> None | Some (name,_) -> Some (if inl then "inline_" ^ name else name)),f), punion p1 (pos e)
  1073. in
  1074. (try
  1075. expr_next (make (secure_expr s)) s
  1076. with
  1077. Display e -> display (make e))
  1078. | [< '(Unop op,p1) when is_prefix op; e = expr >] -> make_unop op e p1
  1079. | [< '(Binop OpSub,p1); e = expr >] ->
  1080. let neg s =
  1081. if s.[0] = '-' then String.sub s 1 (String.length s - 1) else "-" ^ s
  1082. in
  1083. (match make_unop Neg e p1 with
  1084. | EUnop (Neg,Prefix,(EConst (Int i),pc)),p -> EConst (Int (neg i)),p
  1085. | EUnop (Neg,Prefix,(EConst (Float j),pc)),p -> EConst (Float (neg j)),p
  1086. | e -> e)
  1087. (*/* removed unary + : this cause too much syntax errors go unnoticed, such as "a + + 1" (missing 'b')
  1088. without adding anything to the language
  1089. | [< '(Binop OpAdd,p1); s >] ->
  1090. (match s with parser
  1091. | [< '(Const (Int i),p); e = expr_next (EConst (Int i),p) >] -> e
  1092. | [< '(Const (Float f),p); e = expr_next (EConst (Float f),p) >] -> e
  1093. | [< >] -> serror()) */*)
  1094. | [< '(Kwd For,p); '(POpen,_); it = expr; '(PClose,_); s >] ->
  1095. (try
  1096. let e = secure_expr s in
  1097. (EFor (it,e),punion p (pos e))
  1098. with
  1099. Display e -> display (EFor (it,e),punion p (pos e)))
  1100. | [< '(Kwd If,p); '(POpen,_); cond = expr; '(PClose,_); e1 = expr; s >] ->
  1101. let e2 = (match s with parser
  1102. | [< '(Kwd Else,_); e2 = expr; s >] -> Some e2
  1103. | [< >] ->
  1104. match Stream.npeek 2 s with
  1105. | [(Semicolon,_); (Kwd Else,_)] ->
  1106. Stream.junk s;
  1107. Stream.junk s;
  1108. Some (secure_expr s)
  1109. | _ ->
  1110. None
  1111. ) in
  1112. (EIf (cond,e1,e2), punion p (match e2 with None -> pos e1 | Some e -> pos e))
  1113. | [< '(Kwd Return,p); e = popt expr >] -> (EReturn e, match e with None -> p | Some e -> punion p (pos e))
  1114. | [< '(Kwd Break,p) >] -> (EBreak,p)
  1115. | [< '(Kwd Continue,p) >] -> (EContinue,p)
  1116. | [< '(Kwd While,p1); '(POpen,_); cond = expr; '(PClose,_); s >] ->
  1117. (try
  1118. let e = secure_expr s in
  1119. (EWhile (cond,e,NormalWhile),punion p1 (pos e))
  1120. with
  1121. Display e -> display (EWhile (cond,e,NormalWhile),punion p1 (pos e)))
  1122. | [< '(Kwd Do,p1); e = expr; '(Kwd While,_); '(POpen,_); cond = expr; '(PClose,_); s >] -> (EWhile (cond,e,DoWhile),punion p1 (pos e))
  1123. | [< '(Kwd Switch,p1); e = expr; '(BrOpen,_); cases , def = parse_switch_cases e []; '(BrClose,p2); s >] -> (ESwitch (e,cases,def),punion p1 p2)
  1124. | [< '(Kwd Try,p1); e = expr; cl = plist (parse_catch e); s >] -> (ETry (e,cl),p1)
  1125. | [< '(IntInterval i,p1); e2 = expr >] -> make_binop OpInterval (EConst (Int i),p1) e2
  1126. | [< '(Kwd Untyped,p1); e = expr >] -> (EUntyped e,punion p1 (pos e))
  1127. | [< '(Dollar v,p); s >] -> expr_next (EConst (Ident ("$"^v)),p) s
  1128. and expr_next e1 = parser
  1129. | [< '(BrOpen,p1) when is_dollar_ident e1; eparam = expr; '(BrClose,p2); s >] ->
  1130. (match fst e1 with
  1131. | EConst(Ident n) -> expr_next (EMeta((Common.MetaInfo.from_string n,[],snd e1),eparam), punion p1 p2) s
  1132. | _ -> assert false)
  1133. | [< '(Dot,p); s >] ->
  1134. if is_resuming p then display (EDisplay (e1,false),p);
  1135. (match s with parser
  1136. | [< '(Kwd Macro,p2) when p.pmax = p2.pmin; s >] -> expr_next (EField (e1,"macro") , punion (pos e1) p2) s
  1137. | [< '(Kwd New,p2) when p.pmax = p2.pmin; s >] -> expr_next (EField (e1,"new") , punion (pos e1) p2) s
  1138. | [< '(Const (Ident f),p2) when p.pmax = p2.pmin; s >] -> expr_next (EField (e1,f) , punion (pos e1) p2) s
  1139. | [< '(Dollar v,p2); s >] -> expr_next (EField (e1,"$"^v) , punion (pos e1) p2) s
  1140. | [< '(Binop OpOr,p2) when do_resume() >] ->
  1141. set_resume p;
  1142. display (EDisplay (e1,false),p) (* help for debug display mode *)
  1143. | [< >] ->
  1144. (* turn an integer followed by a dot into a float *)
  1145. match e1 with
  1146. | (EConst (Int v),p2) when p2.pmax = p.pmin -> expr_next (EConst (Float (v ^ ".")),punion p p2) s
  1147. | _ -> serror())
  1148. | [< '(POpen,p1); s >] ->
  1149. if is_resuming p1 then display (EDisplay (e1,true),p1);
  1150. (match s with parser
  1151. | [< '(Binop OpOr,p2) when do_resume() >] ->
  1152. set_resume p1;
  1153. display (EDisplay (e1,true),p1) (* help for debug display mode *)
  1154. | [< params = parse_call_params e1; '(PClose,p2); s >] -> expr_next (ECall (e1,params) , punion (pos e1) p2) s
  1155. | [< >] -> serror())
  1156. | [< '(BkOpen,_); e2 = expr; '(BkClose,p2); s >] ->
  1157. expr_next (EArray (e1,e2), punion (pos e1) p2) s
  1158. | [< '(Binop OpGt,p1); s >] ->
  1159. (match s with parser
  1160. | [< '(Binop OpGt,p2) when p1.pmax = p2.pmin; s >] ->
  1161. (match s with parser
  1162. | [< '(Binop OpGt,p3) when p2.pmax = p3.pmin >] ->
  1163. (match s with parser
  1164. | [< '(Binop OpAssign,p4) when p3.pmax = p4.pmin; e2 = expr >] -> make_binop (OpAssignOp OpUShr) e1 e2
  1165. | [< e2 = secure_expr >] -> make_binop OpUShr e1 e2)
  1166. | [< '(Binop OpAssign,p3) when p2.pmax = p3.pmin; e2 = expr >] -> make_binop (OpAssignOp OpShr) e1 e2
  1167. | [< e2 = secure_expr >] -> make_binop OpShr e1 e2)
  1168. | [< '(Binop OpAssign,p2) when p1.pmax = p2.pmin; s >] ->
  1169. make_binop OpGte e1 (secure_expr s)
  1170. | [< e2 = secure_expr >] ->
  1171. make_binop OpGt e1 e2)
  1172. | [< '(Binop op,_); e2 = expr >] ->
  1173. make_binop op e1 e2
  1174. | [< '(Unop op,p) when is_postfix e1 op; s >] ->
  1175. expr_next (EUnop (op,Postfix,e1), punion (pos e1) p) s
  1176. | [< '(Question,_); e2 = expr; '(DblDot,_); e3 = expr >] ->
  1177. (ETernary (e1,e2,e3),punion (pos e1) (pos e3))
  1178. | [< '(Kwd In,_); e2 = expr >] ->
  1179. (EIn (e1,e2), punion (pos e1) (pos e2))
  1180. | [< >] -> e1
  1181. and parse_guard = parser
  1182. | [< '(Kwd If,p1); '(POpen,_); e = expr; '(PClose,_); >] ->
  1183. e
  1184. and parse_switch_cases eswitch cases = parser
  1185. | [< '(Kwd Default,p1); '(DblDot,_); s >] ->
  1186. let b = (try block [] s with Display e -> display (ESwitch (eswitch,cases,Some (Some e)),punion (pos eswitch) (pos e))) in
  1187. let b = match b with
  1188. | [] -> None
  1189. | _ -> Some ((EBlock b,p1))
  1190. in
  1191. let l , def = parse_switch_cases eswitch cases s in
  1192. (match def with None -> () | Some _ -> error Duplicate_default p1);
  1193. l , Some b
  1194. | [< '(Kwd Case,p1); el = psep Comma expr; eg = popt parse_guard; '(DblDot,_); s >] ->
  1195. (match el with
  1196. | [] -> error (Custom "case without a pattern is not allowed") p1
  1197. | _ ->
  1198. let b = (try block [] s with Display e -> display (ESwitch (eswitch,List.rev ((el,eg,Some e) :: cases),None),punion (pos eswitch) (pos e))) in
  1199. let b = match b with
  1200. | [] -> None
  1201. | _ -> Some ((EBlock b,p1))
  1202. in
  1203. parse_switch_cases eswitch ((el,eg,b) :: cases) s
  1204. )
  1205. | [< >] ->
  1206. List.rev cases , None
  1207. and parse_catch etry = parser
  1208. | [< '(Kwd Catch,p); '(POpen,_); name, _ = dollar_ident; s >] ->
  1209. match s with parser
  1210. | [< '(DblDot,_); t = parse_complex_type; '(PClose,_); s >] ->
  1211. (try
  1212. (name,t,secure_expr s)
  1213. with
  1214. Display e -> display (ETry (etry,[name,t,e]),punion (pos etry) (pos e)))
  1215. | [< '(_,p) >] -> error Missing_type p
  1216. and parse_call_params ec s =
  1217. let e = (try
  1218. match s with parser
  1219. | [< e = expr >] -> Some e
  1220. | [< >] -> None
  1221. with Display e ->
  1222. display (ECall (ec,[e]),punion (pos ec) (pos e))
  1223. ) in
  1224. let rec loop acc =
  1225. try
  1226. match s with parser
  1227. | [< '(Comma,_); e = expr >] -> loop (e::acc)
  1228. | [< >] -> List.rev acc
  1229. with Display e ->
  1230. display (ECall (ec,List.rev (e::acc)),punion (pos ec) (pos e))
  1231. in
  1232. match e with
  1233. | None -> []
  1234. | Some e -> loop [e]
  1235. and parse_macro_cond allow_op s =
  1236. match s with parser
  1237. | [< '(Const (Ident t),p) >] ->
  1238. parse_macro_ident allow_op t p s
  1239. | [< '(Const (String s),p) >] ->
  1240. None, (EConst (String s),p)
  1241. | [< '(Const (Int i),p) >] ->
  1242. None, (EConst (Int i),p)
  1243. | [< '(Const (Float f),p) >] ->
  1244. None, (EConst (Float f),p)
  1245. | [< '(Kwd k,p) >] ->
  1246. parse_macro_ident allow_op (s_keyword k) p s
  1247. | [< '(POpen, p1); _,e = parse_macro_cond true; '(PClose, p2) >] ->
  1248. let e = (EParenthesis e,punion p1 p2) in
  1249. if allow_op then parse_macro_op e s else None, e
  1250. | [< '(Unop op,p); tk, e = parse_macro_cond allow_op >] ->
  1251. tk, make_unop op e p
  1252. and parse_macro_ident allow_op t p s =
  1253. let e = (EConst (Ident t),p) in
  1254. if not allow_op then
  1255. None, e
  1256. else
  1257. parse_macro_op e s
  1258. and parse_macro_op e s =
  1259. match Stream.peek s with
  1260. | Some (Binop op,_) ->
  1261. Stream.junk s;
  1262. let op = match Stream.peek s with
  1263. | Some (Binop OpAssign,_) when op = OpGt ->
  1264. Stream.junk s;
  1265. OpGte
  1266. | _ -> op
  1267. in
  1268. let tk, e2 = (try parse_macro_cond true s with Stream.Failure -> serror()) in
  1269. tk, make_binop op e e2
  1270. | tk ->
  1271. tk, e
  1272. and toplevel_expr s =
  1273. try
  1274. expr s
  1275. with
  1276. Display e -> e
  1277. and secure_expr s =
  1278. match s with parser
  1279. | [< e = expr >] -> e
  1280. | [< >] -> serror()
  1281. (* eval *)
  1282. type small_type =
  1283. | TNull
  1284. | TBool of bool
  1285. | TFloat of float
  1286. | TString of string
  1287. let is_true = function
  1288. | TBool false | TNull | TFloat 0. | TString "" -> false
  1289. | _ -> true
  1290. let cmp v1 v2 =
  1291. match v1, v2 with
  1292. | TNull, TNull -> 0
  1293. | TFloat a, TFloat b -> compare a b
  1294. | TString a, TString b -> compare a b
  1295. | TBool a, TBool b -> compare a b
  1296. | TString a, TFloat b -> compare (float_of_string a) b
  1297. | TFloat a, TString b -> compare a (float_of_string b)
  1298. | _ -> raise Exit (* always false *)
  1299. let rec eval ctx (e,p) =
  1300. match e with
  1301. | EConst (Ident i) ->
  1302. (try TString (Common.raw_defined_value ctx i) with Not_found -> TNull)
  1303. | EConst (String s) -> TString s
  1304. | EConst (Int i) -> TFloat (float_of_string i)
  1305. | EConst (Float f) -> TFloat (float_of_string f)
  1306. | EBinop (OpBoolAnd, e1, e2) -> TBool (is_true (eval ctx e1) && is_true (eval ctx e2))
  1307. | EBinop (OpBoolOr, e1, e2) -> TBool (is_true (eval ctx e1) || is_true(eval ctx e2))
  1308. | EUnop (Not, _, e) -> TBool (not (is_true (eval ctx e)))
  1309. | EParenthesis e -> eval ctx e
  1310. | EBinop (op, e1, e2) ->
  1311. let v1 = eval ctx e1 in
  1312. let v2 = eval ctx e2 in
  1313. let compare op =
  1314. TBool (try op (cmp v1 v2) 0 with _ -> false)
  1315. in
  1316. (match op with
  1317. | OpEq -> compare (=)
  1318. | OpNotEq -> compare (<>)
  1319. | OpGt -> compare (>)
  1320. | OpGte -> compare (>=)
  1321. | OpLt -> compare (<)
  1322. | OpLte -> compare (<=)
  1323. | _ -> error (Custom "Unsupported operation") p)
  1324. | _ ->
  1325. error (Custom "Invalid condition expression") p
  1326. (* parse main *)
  1327. let parse ctx code =
  1328. let old = Lexer.save() in
  1329. let old_cache = !cache in
  1330. let mstack = ref [] in
  1331. cache := DynArray.create();
  1332. last_doc := None;
  1333. in_macro := Common.defined ctx Common.Define.Macro;
  1334. Lexer.skip_header code;
  1335. let sraw = Stream.from (fun _ -> Some (Lexer.token code)) in
  1336. let rec next_token() = process_token (Lexer.token code)
  1337. and process_token tk =
  1338. match fst tk with
  1339. | Comment s ->
  1340. let tk = next_token() in
  1341. if !use_doc then begin
  1342. let l = String.length s in
  1343. if l > 0 && s.[0] = '*' then last_doc := Some (String.sub s 1 (l - (if l > 1 && s.[l-1] = '*' then 2 else 1)), (snd tk).pmin);
  1344. end;
  1345. tk
  1346. | CommentLine s ->
  1347. next_token()
  1348. | Sharp "end" ->
  1349. (match !mstack with
  1350. | [] -> tk
  1351. | _ :: l ->
  1352. mstack := l;
  1353. next_token())
  1354. | Sharp "else" | Sharp "elseif" ->
  1355. (match !mstack with
  1356. | [] -> tk
  1357. | _ :: l ->
  1358. mstack := l;
  1359. process_token (skip_tokens (snd tk) false))
  1360. | Sharp "if" ->
  1361. process_token (enter_macro (snd tk))
  1362. | Sharp "error" ->
  1363. (match Lexer.token code with
  1364. | (Const (String s),p) -> error (Custom s) p
  1365. | _ -> error Unimplemented (snd tk))
  1366. | Sharp "line" ->
  1367. let line = (match next_token() with
  1368. | (Const (Int s),_) -> int_of_string s
  1369. | (t,p) -> error (Unexpected t) p
  1370. ) in
  1371. !(Lexer.cur).Lexer.lline <- line - 1;
  1372. next_token();
  1373. | _ ->
  1374. tk
  1375. and enter_macro p =
  1376. let tk, e = parse_macro_cond false sraw in
  1377. let tk = (match tk with None -> Lexer.token code | Some tk -> tk) in
  1378. if is_true (eval ctx e) || (match fst e with EConst (Ident "macro") when Common.unique_full_path p.pfile = (!resume_display).pfile -> true | _ -> false) then begin
  1379. mstack := p :: !mstack;
  1380. tk
  1381. end else
  1382. skip_tokens_loop p true tk
  1383. and skip_tokens_loop p test tk =
  1384. match fst tk with
  1385. | Sharp "end" ->
  1386. Lexer.token code
  1387. | Sharp "elseif" | Sharp "else" when not test ->
  1388. skip_tokens p test
  1389. | Sharp "else" ->
  1390. mstack := snd tk :: !mstack;
  1391. Lexer.token code
  1392. | Sharp "elseif" ->
  1393. enter_macro (snd tk)
  1394. | Sharp "if" ->
  1395. skip_tokens_loop p test (skip_tokens p false)
  1396. | Eof ->
  1397. if do_resume() then tk else error Unclosed_macro p
  1398. | _ ->
  1399. skip_tokens p test
  1400. and skip_tokens p test = skip_tokens_loop p test (Lexer.token code)
  1401. in
  1402. let s = Stream.from (fun _ ->
  1403. let t = next_token() in
  1404. DynArray.add (!cache) t;
  1405. Some t
  1406. ) in
  1407. try
  1408. let l = parse_file s in
  1409. (match !mstack with p :: _ when not (do_resume()) -> error Unclosed_macro p | _ -> ());
  1410. cache := old_cache;
  1411. Lexer.restore old;
  1412. l
  1413. with
  1414. | Stream.Error _
  1415. | Stream.Failure ->
  1416. let last = (match Stream.peek s with None -> last_token s | Some t -> t) in
  1417. Lexer.restore old;
  1418. cache := old_cache;
  1419. error (Unexpected (fst last)) (pos last)
  1420. | e ->
  1421. Lexer.restore old;
  1422. cache := old_cache;
  1423. raise e