World: r3wp
[!REBOL3-OLD1]
older newer | first last |
BrianH 22-Sep-2009 [17772] | LIMIT would apply to the next rule, but that could be a block of rules. |
Pekr 22-Sep-2009 [17773] | ... sorry for having many questions, I am just interested in the topic. Although I am lame parse user, I managed to already parse several cute challenges here = I will never agree, that parse is just only for gurus :-) |
BrianH 22-Sep-2009 [17774x2] | /case will likely stay, though case insensitivity in general in R3 needs some Unicode-related tweaking. |
As for PARSE of ports, it's too ambitious for this round. Wait for the rewrite - we're just tweaking right now. | |
Pekr 22-Sep-2009 [17776] | you think rewrite will happen? It is in closed-source part of REBOL, no? |
BrianH 22-Sep-2009 [17777x2] | Even REVERSE is probably too ambitious for this round. |
I think the rewrite will happen after 3.0 comes out. The most important stuff is done already: NOT, STAY, QUOTE, FAIL. Those open up a world of theoretical possibilities, as Peta has pointed out in great detail. | |
Pekr 22-Sep-2009 [17779] | do you think direct usage of PEG expressions? Well, I am waiting for "my" proposal - multiple to/thru :-) |
BrianH 22-Sep-2009 [17780] | That would be great, but it is likely difficult. We'll see. |
Pekr 22-Sep-2009 [17781x2] | I wonder why I never saw any dialect using paths. Is there any difficulcy in parsing them? E.g. let's say you would like to create REBOL-like language. So you want your 'open command to be treated the same way as open/direct/binary ... |
btw - what happens to DELECT. Is is still usefull, after we enhance parse? | |
BrianH 22-Sep-2009 [17783x3] | The parse enhancements, particularly OF, were prompted by the failure of DELECT to simplify the new VID. |
That and NOT, needed for Unicode at first. | |
I never got a good handle on DELECT, so I can't judge it too well. It seemed like the JIT binding of rebcode, but without the accellerated dispatch model. I wasn't clear on how DELECT dialects could be efficiently implemented. | |
Henrik 22-Sep-2009 [17786] | The USE proposal intrigues me. I've often had issues with how some set words would appear to be in their own context, if set, deep inside a parse block. I can't come up with an example right now, though. Will all words be in a global context by default now? |
BrianH 22-Sep-2009 [17787] | No, words are still unbound by default. The miscellaneous loading mezzanine code binds the words to the appropriate contexts. PARSE won't do any binding, except probably to the keywords. The USE operation would be the only binding operation. |
Henrik 22-Sep-2009 [17788] | In other words (heh), USE gives us total and explicit control over that, which is good. I hate that in R2 parse. |
Pekr 22-Sep-2009 [17789] | Dunno if related, but I did recursive parsing with backtracking, and I needed to store stuff at each nesting, and it took me some time to find out, how to isolate the stuff. If I can have control upon what is local for my purposes, then it is very welcomed feature ... |
BrianH 22-Sep-2009 [17790] | The USE operation was my best guess at a solution to that problem 4 years ago, but I'm still hopinng that Carl comes up with something better sing some magic R3 trick. |
Maxim 22-Sep-2009 [17791x2] | what implementation of proposed USE is done? use-1 or use-2? |
I really wish OF was implemented for 3.0 this single rule makes SOOOOO MAAANNNNYYYY parse rules simpler for beginners. even if its slow, its like the entry-point to parse... If you can make make it work with this, at least you get people into the band wagon, and then they will get better at it. | |
Pekr 22-Sep-2009 [17793] | Max - what is it good for? It only works with block parsing, no? Most beginners start with parse to parse some strings from outer systems, not to build own dialects :-) |
Maxim 22-Sep-2009 [17794x6] | it should work with strings too. but it allows very easy dialecting as it is now anyways. |
(I mean it should be expanded to work with strings too) | |
but I can see how its complex to implement. | |
are the TO and THRU with multiple values on the table for 3.0 ? | |
yes it seems they are, cool, with conditionals also making the cut, I believe, 3.0 parse will be a hell of a mean monster for data crunching. | |
damn, the blog is giving me abuse notifications. :-( | |
Pekr 22-Sep-2009 [17800] | you can't poste way too frequently :-) |
Henrik 22-Sep-2009 [17801x2] | does anyone have trouble escaping from a long operation in the R3 console? |
hmm... I guess you use Ctrl-C, but that doesn't seem to be correct signalling in the OSX console. I would expect R3 to quit. Then again, the Python console does the same. | |
Pekr 22-Sep-2009 [17803] | R3 console is substandard, at least under Window. Dunno what you mean, but I have some problems when I start it - sometimes there is busy indicator long time even after console is launched, sometimes it starts and does not get its focus .... |
Oldes 22-Sep-2009 [17804] | There is also bug that it's not escape from WAIT. |
Pekr 22-Sep-2009 [17805] | yes, you can't ESC from wait .... what a let-down :-) |
Henrik 22-Sep-2009 [17806] | http://www.rebol.net/r3blogs/0248.html Oh, now this is fun. |
Pekr 22-Sep-2009 [17807] | ... getting better and better, heh? :-) |
Henrik 22-Sep-2009 [17808] | this is probably the best part |
Maxim 22-Sep-2009 [17809] | its definitely going to make it easier for people to learn it and for advanced users to debug complex rules :-) |
BrianH 22-Sep-2009 [17810] | USE 2 won't work - see the editor's notes (I was the editor). |
Maxim 22-Sep-2009 [17811] | k |
Pekr 22-Sep-2009 [17812] | I think I don't understand the outcome of EITHER parse blog. don't like + sign, as I immediatelly think in math terms ... |
BrianH 22-Sep-2009 [17813] | Parse theory is a branch of math. |
Pekr 22-Sep-2009 [17814] | I don't care of theory. If I want to be like others, I go for (for me) totally unreadable regular expressions ... |
BrianH 22-Sep-2009 [17815] | We're talking about having STAY be changed to infix &. It's cool to hear that infix is possible (according to Carl). |
Pekr 22-Sep-2009 [17816x2] | When I read initial EITHER proposal, it was imediatelly clear, what it does. Whereas I am looking at following code, not being able to gues, what it is about. It way too much implies math operation, not some lexical thing: [a + b | c | d] [a + 2 b | c | d] [a + not b | some c | d] |
why not use ! instead of word NOT then? | |
BrianH 22-Sep-2009 [17818] | When I read the initial EITHER proposal, I gave it a maybe. It didn't act like the EITHER function, and that would be confusing. |
Maxim 22-Sep-2009 [17819x3] | I REALLY don't like where this is headed... :-( |
sorry... we clamour about parse not being RE and here we are making it possibly even more obscure... with implied branches... by using a "+" no less.... sorry. | |
[a 2 + b | c | d | e] is beyond obscure. | |
older newer | first last |