World: r3wp

You want to write JS in Rebol console?

>> s: {a^/{b}c^{d^}"e"}
== {a
{b}c{d}"e"}

no, I am parsing it automatically...the console I was just testing, 
but that makes the problem worse, methinks

I think you meant this (or at least I would have wanted you to mean 
this):
>> s: {a^{b^}c^{d^}"e"}
== {a{b}c{d}"e"}

that still doesn't cut the mustard for me...but can be useful for 
part of it.


to-string 4838f{gmgmg{    ;this doesn't work because REBOL doesn't 
know what datatype 4838f{gmgmg{ is, but I don't want REBOL to know 
that.  I want REBOL to make it into a string.

to-string/raw or to-string/force could be a useful refinement so 
that I could write parse like this:


print parse/all to-string/force ;alksjdf;alsjdflk;{""""}}}}}    parse-rules 
  ;I think this would be a VERY useful thing.

I don't understand how it could work like

it would need a terminator pattern to know when to stop it


print parse/all to-string/force ;alksjdf;alsjdflk;{""""}}}}}terminate 
parse-rules   ;I think this would be a VERY useful thing.

you mean something like that http://en.wikipedia.org/wiki/HEREDOC
? That could be useful.

but that's not parse related, the Rebol lexer should be improved 
to do that.

we can try to ask Carl

It is strongly related...for sure.  One of my requirements in a good 
OS which is not done yet is to NEVER lose anything I type, EVER.

That page of Wiki is very good to beg my case, thanks!

I remember another cool console that someone did in a web page that 
was very slick...sorry, my mind associates things that it shouldn't...my 
parser is too massively parallel...;-)

It's like closing the loop on Chris's make-doc-anywhere...but REBOL 
can be the most elegant here for that Heredoc.

eFishAnt, the {} nesting rules only apply to strings entered in {}, 
not "". They are also only a REBOL syntax trick. Strings that you 
construct or read from somewhere don't have any special escaping 
rules or syntax.

REBOL doesn't lose what you type, but if what you are typing is treated 
as REBOL syntax, then it is interpreted as such, not lost.

I have a problem with sub-rule parsing I have:

myrules: [
	any [
		set src path! set des path! (?? src ?? des)
		| 'keyword into [
			...
		]
	]
]

If the input is

a/1 a/2
mykeyword
a/1 a/2


Only the first paths are printed. Why this? I thought the ANY rule 
keeps going on unti the end.

I think it has something to do with INTO not return true.

The INTO is still just a proposal http://www.rebol.net/wiki/Parse_Project#INTO

Robert, your rule steps INTO the second a/1, and then, I suppose, 
fails to reach the end of it.

Show us the INTO rule, and we will tell you what is wrong with it. 
PARSE will treat the path a/1 like the block [a 1] eg:
	>> parse [a/1][into [here: (print mold here) 'a 1 1 1]]
	[a 1]
	== true

(You also wrote 'keyword in your rules, but 'mykeyword in your input. 
I'm hoping that was just a typo.)

INTO is not a proposal, the proposal is to extend INTO to string 
types, possibly with a type check.

Thanks for all the helps on parse...I have my new platform working 
100% as of this morning.  The labor of over a year of technology...and 
the code keeps getting smaller and faster.  100% REBOL.  It's all 
dialects.

eFish - what is your new platform about? Still an IOS, or anything 
new? Once new rebol.com site is done, we need your success stories 
:-)

I've been hoping for these publicly for years... but you won't get 
them.  Competitive advantage, and you have to respect that.  Although, 
if the companies were left nameless and so was the author, then maybe 
he could atleast outline the concept that was involved or the problems 
that were overcome.

The impact wouldn't be as big, but it would definitely hope show 
the industrial strength of Rebol.

100% rebol platform? What are we talking about here?

I have another month or so before deployment.  Still lots of busy 
work, mostly more parse rules.  I probably shouldn't say much yet, 
but I was excited after a weekend of breakthroughs, and anyway, I 
wanted people to know I am even more heavily invested in REBOL than 
ever.

The {^}^{^}^{^}} problem went away by thinking about it differently, 
so now Javascript doesn't bite me any more...

some hints ?

or u just arousing us

a month or few and I should be ready to say more.  I just got too 
excited...;-)

shame on u ;-)

How can I parse into a paren! ?
I've tried: 
parse [(a b)] [paren! into [word! word!]]

but It doesn't work

>> data: [( a b )]
== [(a b)]
>> parse data [ into [set w word! set 
v word!] (print [ v w])]
b a
== true

Silly formatting on macbook paste, but you get the idea. Leave the 
paren! match out of your rule:

i.e rule: [ into [ set v word! set w word!] (print [ v w])]

Ok, the paren! consume the input, but how can I parse only paren! 
?
your rule work for (a b) and for [a b]

>> parse [[a b]] rule
a b
== true
>> parse [(a b)] rule
a b
== true

...or better, do you know where I can find a simple algebra parse 
script, which can compute simple expression like [1 + (2 /3)] ?
I'm learning how to parse, and such example would be illuminant

>> rule: [mark: paren! :mark into [ set v word! set w word!] (print 
[ v w])]
>> parse [[a b]] rule
== false
>> parse [(a b)] rule
a b
== true

There's a nice example here : http://www.rebol.com/docs/core23/rebolcore-15.html#section-6, 
but it requires a string! value as input. You could adapt it to use 
a block! value as input.

Try to play with this: http://oldes.multimedia.cz/rebol/expr-test.r

or:
http://oldes.multimedia.cz/rebol/expr-test2.r
http://oldes.multimedia.cz/rebol/expr-test3.r

thanks ! I'm going to study it

ok this is my first attempt for a basic expression parser

stack: copy []
push: func [x] [insert stack x]
pop: does [take stack]
term: [
	pos: paren! :pos into [expr] (push rejoin ["(" pop ")"]) |
	set t string! (push mold t ) | 

 set sign opt ['+ | '-] set t number! (if none? sign [sign: '+] push 
 mold (t * to-integer join sign "1")) | 

 set gp path! (push rejoin [{$('#} first gp {').attr('} second gp 
 {')} ]) 
]
oper: compose ['+ | '- | '* | (to-lit-word "/")]
operrule: [set o oper (push o)]

expr: [term any [operrule term (t2: pop o: pop t1: pop push rejoin 
[t1 o t2])]]


I'm sure it's not optimized nor correct, so any correction is welcome.

it can parse expression like: [- 1 * (a/b + 2)] and it emits a javascript 
compatible string.
(is a part of a comet server written in rebol)

instead of:

set sign opt ['+ | '-] set t number! (if none? sign [sign: '+] push 
mold (t * to-integer join sign "1")) |
I would use something like:
    set t number! (push mold t ) |
 '- set t number! (push mold negate t ) |

(Which is not perfect as well)

because the above will not work for expressions like: [ - (1 + 1)]

also I'm not sure, if the mold is needed

I am having some parse difficulties.  I have the below code...