[00:18:52] *** Joins: atoll (~atoll@194-29-25-170.static.cablecom.ch) [00:30:14] *** Quits: atoll (~atoll@194-29-25-170.static.cablecom.ch) (Ping timeout: 245 seconds) [01:04:29] *** Joins: atoll (~atoll@194-29-25-170.static.cablecom.ch) [03:11:14] *** Quits: atoll (~atoll@194-29-25-170.static.cablecom.ch) (Ping timeout: 276 seconds) [10:18:26] *** Joins: atoll (~atoll@crossing1.epfl.ch) [12:56:52] Hello jstar, so i've decided to try to rewrite the library in scala. I have a trouble reading this line https://github.com/GrammaticalFramework/GF/blob/master/src/runtime/haskell/PGF/Binary.hs 166: " get = get >>= \(hypos,fid) -> return (PArg (zip (repeat fidVar) hypos) fid)" What is fidVar ? [13:04:00] Sorry to be the annoying one jstar :D [13:08:59] *** Quits: atoll (~atoll@crossing1.epfl.ch) (Quit: WeeChat 0.4.1) [13:09:16] *** Joins: atoll (~atoll@crossing1.epfl.ch) [14:13:57] hi atoll, just came back from luncuh [14:14:02] let me have a look for you [14:48:55] fidVar is defined in PGF.Data as -4 [14:49:27] I guess this is some kind of default id [14:50:49] I wonder in this case if in this context Var is referring to meta-variable, ie when you use question marks in a tree [15:00:27] Ok thanx you jstar [15:00:35] I will use -4 as value [15:00:48] I'm making good progress [15:00:53] the pgf parsing is finished [15:02:13] :) [15:02:27] are you hosting this code on GitHub or similar? [15:02:31] I will try to do my possible to convince my boss i can make it open source jstar [15:02:48] But they don't like the open source idea so much [15:02:58] that's a shame [15:03:17] I find it too. Futhermore we're using open source, we could contribute. [15:03:24] But it's not mine to decide [15:03:27] :< [15:03:31] so they like using open source but not contributing :P [15:03:37] yes [15:03:40] no I completely understand [15:33:59] jstar: does this code produce a list of AK ? [15:34:01] let keys = do fid <- range (s,e) [15:34:02] lbl <- indices labels [15:34:05] return (AK fid lbl) [15:34:54] keys: [AK] ? with every combination of fid and lbl in range (s,e) and range (0,labels.length-1) ? [15:35:38] where is this from? [15:36:21] initState in Parser.hs [15:36:28] Parse.hs* [15:36:34] l:86 [15:44:14] yes, keys should be of type [AK] [15:44:36] or rather [ActiveKey] [15:44:49] (AK is the constructor for type ActiveKey) [15:44:58] yes [15:45:04] why not use map ? [15:45:19] It's do notation, no? http://learnyouahaskell.com/a-fistful-of-monads#do-notation [15:45:52] Not a list comprehension. [15:46:17] you could prob do it with map to [15:46:26] lists are monads so you can use do notating with them [15:46:46] often it's just a case of style/preference [15:47:08] ok [15:47:16] I will use a list comprehension in scala :d [15:49:15] for comprehension* [16:11:07] jstar: I have trouble understanding what is flit in predict (which is used in initState). Also there is no type to predict :d In Parse.hs [16:11:14] Thanx you in advance :) [18:38:45] jstar: do you know what flit and ftok are in predict and others of Parse.hs ? [18:38:51] the lack of type is troubling me :d [18:39:11] from flit _ = Nothing i guess it's sth like A => Option[B] [18:39:20] Maybe b* [18:41:19] i got it for flit, it's FId -> Maybe (CId,Tree,[Token]) [19:48:33] *** Quits: atoll (~atoll@crossing1.epfl.ch) (Ping timeout: 246 seconds) [19:54:03] hi atoll, sorry did not see this until now – good that you figured it out [21:36:57] *** Joins: atoll (~atoll@194-29-25-170.static.cablecom.ch) [21:42:12] *** Quits: atoll (~atoll@194-29-25-170.static.cablecom.ch) (Ping timeout: 256 seconds) [22:21:25] *** Joins: atoll (~atoll@194-29-25-170.static.cablecom.ch) [23:32:35] *** Joins: darinm (~darinm@unaffiliated/darinmorrison)