2022-01-11 04:53:47 <veltas      >  Has anyone thought about a FORTHy approach/aternative to regexs?
2022-01-11 04:54:00 <veltas      > We already kind of have that with some of the parsing features but anything else?
2022-01-11 04:55:58 <boru        > I imagine it would require specifying regexes in some sort of RPN, at least. ISTR there being a bunch of stack based regex algorithms knocking around already.
2022-01-11 04:56:02 <boru        > If that's what you mean, of course.
2022-01-11 04:56:58 <veltas      > Info on that would be interesting
2022-01-11 05:01:28 <veltas      > Regex's just require a finite automata to process, so no stack is needed. A stack would be needed to parse a context free grammar
2022-01-11 05:01:59 <veltas      > But I personally think a FORTHy solution to parsing wouldn't involve that language theory at all
2022-01-11 05:02:11 <veltas      > I'm interested in what people have done that goes beyond the basic forth parsing words
2022-01-11 05:02:18 <boru        > I'll see if I can dig it out. I think thought it was something I read in Unix Text Processing, but I just checked, and it wasn't.
2022-01-11 05:02:41 <boru        > Might have actually been in a compiler book.
2022-01-11 05:09:22 <boru        > I had a quick scan through my compiler books, and no sign of it there, either. I'll have a poke around later after work.
2022-01-11 05:11:27 <veltas      > The regex stuff in ed always struck me as very simple/easy
2022-01-11 19:15:02 <pao13[m]    > Is `dc` considered a forth?
2022-01-11 19:15:22 <f-a         > maybe not a forth but a RPN calc
2022-01-11 19:19:06 <pao13[m]    > what separates a forth from other programming language?
2022-01-11 19:19:15 <pao13[m]    > what qualities does a forth have to have?
2022-01-11 19:20:20 <f-a         > well dc is not turing complete is it?
2022-01-11 19:21:01 <f-a         > forth, idk: stack based, simple to implement from the ground up, dictionary, create/does> that is what pops to mind
2022-01-11 19:21:14 <eris[m]1    > two stacks
2022-01-11 19:21:18 <eris[m]1    > words
2022-01-11 19:21:27 <eris[m]1    > moore would say blocks
2022-01-11 19:25:42 <joe9        > read starting forth.
2022-01-11 19:31:09 <eris[m]1    > thats not a very good explanation :p
2022-01-11 19:31:23 <eris[m]1    > what is a proper forth to you
2022-01-11 19:32:15 <eris[m]1    > to me, the low level is almost inherent, because otherwise it doesnt really fit the image i have of being able to muck with whatever i want
2022-01-11 19:33:01 <eris[m]1    > if its interpreted in python, im not exactly going to be able to do all the fun memory stuff am i
2022-01-11 19:34:01 <eris[m]1    > i dont think it'll be possible to arrive at an exact forth definition
2022-01-11 19:34:43 <eris[m]1    > even at an individual level, some things will just feel not-forth
2022-01-11 19:34:48 <eris[m]1    > like factor