That is not necessarily the case - certainly not with R2's implementation of PARSE.
In the hands of experts (such as Maxim) it was often much faster than procedural code. There were many speed challenges over on the Mailing list and Altme. PARSE usually won.
Dunno if Red's PARSE is yet optimized internally - but you may be surprised by how nifty it can be.
trim
?
take
instead, if you care about removed values.
$
I can get the string on the left ?
@nedzadarek There is one more accessor: set-word!
c: [a: 1 b: 2 (y 5) 6]
y: 'a
c/:y
;== 1
y: quote (y 5)
c/:y ; But this gets the evaluated result of parens, which is 5, so 5th element
;== (y 5)
c/(y) ; This selects as `select/only`
;== 6
Consider also this
c: [a: 1 b: 2 (y 5) 6 x 3 x: 4]
y: quote x:
;== x:
c/:y ; Selects first x
;== 3
c/(y) ; Also selects first x
;== 3
select/same c quote x: ; Only this selects exactly
;== 4
select/same c y
;== 4