parser.ml 52 KB

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