00:00:00 --- log: started retro/06.10.14 01:31:41 --- join: Cheery (n=Cheery@a81-197-19-23.elisa-laajakaista.fi) joined #retro 02:08:12 --- quit: erider (Read error: 110 (Connection timed out)) 02:08:13 --- join: erider_ (n=erider@unaffiliated/erider) joined #retro 04:35:08 --- part: Cheery left #retro 05:39:22 --- join: Cheery (n=Cheery@a81-197-19-23.elisa-laajakaista.fi) joined #retro 06:03:37 --- nick: erider_ -> erider 07:58:56 --- join: nighty_ (n=nighty@sushi.rural-networks.com) joined #retro 08:59:06 hmm. I think I'd prefer to close the comment with something other than what it was opened with. 08:59:10 http://retroforth.net/paste/?id=219 09:28:04 http://retroforth.net/paste/?id=221 13:57:58 good afternoon 14:11:30 hi 14:11:47 hi cheery 14:19:12 hi Q, crc 14:22:07 hi erider 14:24:20 hi 14:24:44 Hey Ray 14:25:12 The self organizing priciple. Now, let us create a program for the masses. What shall we? 14:25:26 What have the masses done for me lately? 14:25:36 hmm, ... 14:25:41 or umm really. 14:28:29 The masses has developed a complicated system of delivering every possible modern convenience and conveyance. 14:28:52 I first thought you said 'inconvenience and annoyance'. 14:29:01 Same thing, really. 14:32:01 Same thing, because: For every action there is an equal and opposite depression, physically and mentally. 14:32:23 I want the masses to hold up their end for a change. :) 14:32:33 How high? 14:32:39 I've just written a BNF lexical parser for Forth. Nobody in #forth seems interested. 14:33:02 sorry. It's a parser, but it's a lexical analyzer. 14:33:05 I'm interested. I just saw one the other day. 14:33:19 You did? Oh, you mean a BNF implementation? 14:33:22 I love the BNF thingy. 14:33:24 ya. 14:33:31 ummm /me looks 14:34:08 http://www.zetetics.com/bj/papers/bnfparse.htm 14:34:16 Mine is built on a BNF implementation -- it analyzes Forth input lexically. It embodies the rules for singles, doubles, floats, and names. It has a strict mode that has the minimum required rule set, and a slightly more relaxed one that's more commonly encountered. 14:34:39 Yes, I built a Standard BNF module from the ideas in that one in your link. 14:34:45 Excellent. Well done. Sounds like a fun thing to compile. 14:35:16 Must make for a great prototyping language. 14:35:38 or is that meta-language. 14:35:50 It's an example of how little languages work so well in Forth -- bnf: ;bnf for instance. 14:36:13 neat. 14:36:16 And also a useful tool, as I'm documenting caveats for formatting numbers when writing portable code. 14:37:15 hmm. 14:37:24 what kind of syntax things can you do with BNF? 14:37:34 I appreciate a language that allows you to follow the tokens to the very atoms of the mechanics of the thing it describes. 14:37:59 For instance strict minimal Standard compliance means double-cell numbers have a dot at the end, but not in the middle. Strict Standard floats begin with a digit, not with '.'. Etc. 14:39:31 hmm. I don't know whether I should hate or love it. 14:39:44 Cheery, BNF defines a grammar for parsing, a set of rules; when input matches the rules, you can generate appropriate code. It's one stage of a typical compiler. 14:40:18 I know a bit about it. 14:40:21 Forth systems do lexical analysis in the interpreter loop, but it's not formalized. BNF is a formalized system for specifying the rules. 14:40:53 why should it be formalized? 14:41:55 But can't you do those horrible things like mathematical notation with BNF? 14:42:08 It is, in fact, formalized in the Standard. It isn't in a formalized form inside a given Forth, but instead is embedded in the logic of the interpreter loop, along with words such as skip, scan, parse, >number, >float, etc. 14:42:56 Neat for special data handlers. 14:43:20 I can see cool databases written in a BNF-Forth. 14:43:42 Right. I'm not arguing against the implementation. I'm not, in fact, arguing. This parser lets me explore the ramifications of extending or relaxing the parsing rules. 14:44:00 oh well. Maybe I'm just having cold creeps when C is mentioned. 14:44:06 I didn't mention C. 14:44:07 :) 14:44:15 and it could be on the fly, as the newer types are built ontop of running types... 14:44:16 in the paper C was mentioned 14:45:07 That's true, Raystm2, though I can't quite envision how it would fit into a database system -- but you could build some interesting language translators with it. 14:47:00 Cheery: I use C for some things... :) 14:48:48 It's ok for some things, still it is causing cold waves on my neck. 14:49:55 I greatly prefer forth 14:51:12 --- quit: erider (Read error: 110 (Connection timed out)) 14:51:23 if I see no [1 + 2] -syntax sugar done for forth, I'm feeling quite safe myself and consider BNF being a good thing.. :) 14:51:43 If I see... well. I dont. 14:52:12 --- join: erider (n=erider@unaffiliated/erider) joined #retro 14:55:02 btw. crc, I'm doing a subleq virtual machine (von neuman architecture and 8 bit I/O, only one instruction in set) for rx. 14:55:09 I'm showing it when I'm done. :) 14:57:39 the IP is only 6 bits really, and there is one 'immediate' -field in the machine. 15:00:22 maybe I'm using the remaining 2 bits for something intresting which actually uses the 'immediate' -field in the instruction. 15:32:36 --- quit: nighty_ (Read error: 101 (Network is unreachable)) 15:43:22 --- join: nighty_ (n=nighty@sushi.rural-networks.com) joined #retro 15:47:29 --- quit: Cheery ("Download Gaim: http://gaim.sourceforge.net/") 16:21:50 --- join: erider_ (n=erider@unaffiliated/erider) joined #retro 16:22:54 --- quit: erider (Read error: 110 (Connection timed out)) 16:39:07 --- quit: erider_ (Read error: 110 (Connection timed out)) 16:39:59 --- join: erider (n=erider@unaffiliated/erider) joined #retro 16:41:25 --- join: snoopy_1711 (i=snoopy_1@dslb-084-058-150-055.pools.arcor-ip.net) joined #retro 16:49:45 --- quit: Snoopy42 (Read error: 145 (Connection timed out)) 16:49:46 --- nick: snoopy_1711 -> Snoopy42 16:58:17 --- quit: Raystm2 (Read error: 60 (Operation timed out)) 17:35:45 --- join: jas2o (n=jas2o@WNPP-p-203-54-32-102.prem.tmns.net.au) joined #retro 17:39:59 --- join: Raystm2 (n=NanRay@adsl-68-93-121-192.dsl.rcsntx.swbell.net) joined #retro 18:44:51 --- quit: jas2o ("Chatzilla 0.9.74 [XULRunner 1.8.0.1/2006012608]") 19:25:50 --- quit: erider (Read error: 104 (Connection reset by peer)) 19:30:19 bnf: ... ;bnf -- neat 19:32:11 --- join: erider (n=erider@unaffiliated/erider) joined #retro 21:23:23 --- quit: erider ("I don't sleep because sleep is the cousin of death!") 23:59:59 --- log: ended retro/06.10.14