World: r3wp
[!REBOL3]
older newer | first last |
BrianH 2-Nov-2010 [5996x4] | I'm testing again with a110. |
Same behavior. | |
The ASSERT in FIND-ALL has SERIES! instead of SERIES?. Doesn't affect the behavior normally, but doesn't screen for the error either. | |
I noticed that FIND-ALL is just as Scheme-like as ANY-OF and ALL-OF :) | |
Carl 2-Nov-2010 [6000x2] | lol ;) |
Ok, A110 is out, but I'm going to be away for 2 days. I'll try to check-in to see if there are any questions here. | |
BrianH 2-Nov-2010 [6002] | I'll add a ticket for the FIND-ALL bug (it's minor and only affects erroneous code). |
Pekr 2-Nov-2010 [6003] | will Maxim's #1716 be resolved somehow? |
BrianH 2-Nov-2010 [6004] | Yes, but we haven't yet determined the option name. Delayed embedded extensions should work now though. |
Ladislav 2-Nov-2010 [6005] | Do I recall correctly that there was a reason tuple! values couldn't be extended to 16 slots? - yes |
Sunanda 2-Nov-2010 [6006] | Is the safe R3 way to execute a script to use: do load %script-name rather than R2's way: do %script-name ? The reason I ask is the different behaviours I see here (I'd expect them both to print a 1).... n: 1 try [do %test-script.r ] print n n: 1 try [do load %test-script.r ] print n ....where test-script.r is these two lines: rebol [] 0 / 0 |
Ladislav 2-Nov-2010 [6007] | Yes, that difference is related to bug#851 |
Sunanda 2-Nov-2010 [6008] | Thanks.....Looks like you and Brian have some deep dialog going around those issues. Hope it all comes clear in the end :) |
Carl 2-Nov-2010 [6009x5] | B: I figure funcs like FIND-ALL will go thru various stages of revision. |
B, P: probably post lib should be extension default. Then we can just add prelib as word for those done prior. This can be added to A111. For now, use delay, as Brian mentioned. | |
If you need a 16 slot tuple, you're using the wrong datatype. | |
Sunanda, yes... a bug we know about. | |
But, you started it. ;) -- all related to the meaning of "quit" | |
Pekr 2-Nov-2010 [6014] | What about suggested names to FOR-ALL? Not important, but there were some suggestions in related tickets (and blog) ... e.g. FORFOUND (sounds a bit weird, so maybe FORFIND)? :-) |
Gregg 2-Nov-2010 [6015] | The question on tuples was related to IPv6 addresses. Just thinking about how the 128 bits might map into a type and syntax. |
BrianH 2-Nov-2010 [6016] | Having a different datatype for IPv6 addresses would pay off in practice - the networking code would be more efficient. Even if that other type is binary!, you would get better efficiency as long as it isn't tuple. |
Gregg 2-Nov-2010 [6017] | I'm all for having an IPv6 type. |
BrianH 2-Nov-2010 [6018] | And that doesn't even get into the syntax issues: IPv6 syntax is really different, not the same as dotted. A different type would allow different syntax. But that syntax is really specific, only used for that one thing, and not necessarily a very common thing at that (do you tend to type out IPv6 addresses, or the domain names that refer to them?). It's not like tuples, that get used outside of the networking realm. It really might not be bad to just use strings for the IPv6 syntax, and binaries for the decoded values. We don't have to wait for syntax changes to get started. And once we get something running, the syntax changes would be easier to justify :) |
Maxim 2-Nov-2010 [6019] | yeah the ipv6 addresses really are different. |
Sunanda 2-Nov-2010 [6020] | They are quite a complex data structure, or can be. Perhaps a first step would be for someone to write a parse rule to identify/vaidate IPv6 strings and, optionally, translate them to a normative form. Link to someone who has made a stab at a BNF defintion for IPv6, and then produced a regex: http://crisp.tweakblogs.net/blog/2031/ipv6-validation-%28and-caveats%29.html |
Maxim 2-Nov-2010 [6021] | funny how all of his problems seem to disapear when we look at it with a parse mindset :-) |
BrianH 2-Nov-2010 [6022] | PEG beats BNF :) |
Maxim 2-Nov-2010 [6023] | but even the BNF is something I can use almost directly in parse and its easy. now trying to use that in regexp or a loop/conditionals driven function ... yeah... mental. |
Gregg 3-Nov-2010 [6024x4] | I stripped all rule tracing from the following. Tests not included either, to save space here. |
ipv6-parser-ctx: context [ IPv6address: [ (=IPv6address: none) copy =IPv6address [ 6 [h16 ":"] ls32 ; 8 | "::" 5 [h16 ":"] ls32 ; 7 | opt [h16] "::" 4 [h16 ":"] ls32 ; 6-7 0-1::6 | opt [h16 0 1 [":" h16]] "::" 3 [h16 ":"] ls32 ; 5-7 0-2::5 | opt [h16 0 2 [":" h16]] "::" 2 [h16 ":"] ls32 ; 4-7 0-3::4 | opt [h16 0 3 [":" h16]] "::" h16 ":" ls32 ; 3-7 0-4::3 | opt [h16 0 4 [":" h16]] "::" ls32 ; 2-7 0-5::2 | opt [h16 0 5 [":" h16]] "::" h16 ; 1-7 0-6::1 | opt [h16 0 6 [":" h16]] "::" ; 0-7 0-7::0 ] ] h16: [ (=h16: none) copy =h16 mark: 1 4 HEXDIG ;(print ['h16 mold =h16 mold mark]) ] ls32: [ (=ls32: none) copy =ls32 [[h16 ":" h16] | IPv4address] ] IPv4address: [ (=IPv4address: none) copy =IPv4address [dec-octet "." dec-octet "." dec-octet "." dec-octet] ] charset-1: (charset [#"1" - #"9"]) charset-2: (charset [#"0" - #"4"]) charset-3: (charset [#"0" - #"5"]) dec-octet: [ copy =dec-octet [ "25" charset-3 ; 250-255 | "2" charset-2 DIGIT ; 200-249 | "1" 2 DIGIT ; 100-199 | charset-1 DIGIT ; 10-99 | DIGIT ; 0-9 ] ] DIGIT: charset "0123456789" HEXDIG: charset "0123456789ABCDEFabcdef" set 'parse-ipv6-address func [address [any-string!]] [ reduce [parse/all address IPv6address =IPv6address] ] ] | |
It's a mechanical translation of the ABNF, with some rules reordered for PARSE. | |
Is it worth pursuing? If so, what should be next? | |
BrianH 3-Nov-2010 [6028] | Dealing with the formatted addresses is kind-of the last step. The first step in looking at the native TCP code and seing what needs to be done to support connecting over IPv6. There might be some native API changes required. |
AdrianS 3-Nov-2010 [6029] | Could this be used to get R3 running on the JVM? Seems too easy... http://www.axiomsol.com/ |
Maxim 3-Nov-2010 [6030] | that's interesting. |
Kaj 3-Nov-2010 [6031] | That must be pretty slow if you use it for a complete interpreter. And you would still need some REBOL level binding to use Java classes |
BrianH 3-Nov-2010 [6032x5] | I had given the topic some thought, with the Portable.NET C compiler. |
At this point, all attempts to *use* R3 have been inspiring the improvements of R3. We are better off not separating them for now. | |
And we have use groups for particular topics, like modules or networking. | |
We could probably make a !REBOL3 Proposals group, but expect a lot of overlap with the other R3 groups :) | |
Back to REBOL on Java, I expect that the REBOL on .NET bindings would be semantically similar. We would be better off if we tried to make them as similar as possible in low-level semantics, so more code will be portable between Android and WinPhone7, for instance. | |
Maxim 3-Nov-2010 [6037x2] | yeah there would be overlap.... but it would be the proper place to argue about new ideas, changes in the language, naming wars, etc, how *should* it work the other groups, IMHO, are meant for more "getting things done". how *does* this work?. |
wrt REBOL on JAVA... probably only the host-kit would be an issue. | |
Pekr 3-Nov-2010 [6039] | not sure REBOL on JAVA would be usefull nowadays. JAVA is dead :-) REBOL on JS would be interesting though :-) |
Kaj 3-Nov-2010 [6040] | And even slower |
BrianH 3-Nov-2010 [6041x2] | The host kit would be an advantage if we are going the native library route. All we would need is to create hosts that asct like Java-like or .NET-like native extensions. |
Java is not dead on Android (yet). I am very interested in REBOL for Java because of this. | |
Maxim 3-Nov-2010 [6043] | yep... I meant that it would be only thing which would really require changes to make it work... the rest is just bits and memory allocation, which is being run within the loaded app. |
Kaj 3-Nov-2010 [6044] | Never pronounce something dead, as it will live longer |
Pekr 3-Nov-2010 [6045] | Kaj: Amiga? :-) |
older newer | first last |