parser.ml 52 KB

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