While there are ways to work around nesting to a known depth, it gets
ugly quickly, and nesting to an arbitrary depth is beyond the ability
of regexes to match directly.
What you can do is write a parser that uses regular expression and
additional code to find the substring you are searching for.
Hi Robert
Thanks very much for your reply.
Unfortunately, as you say, the expression won't work in situations
where there's a closing brace within the function (eg., delimiting the
end of the a case function, or a forloop)
But, the idea of employing the function / class statement in the
open
Hi
Thanks for your reply.
I may have to look at a non-regex method.
Cheers
Marty
--- In flexcoders@yahoogroups.com, "jer_ela" <[EMAIL PROTECTED]> wrote:
>
> While there are ways to work around nesting to a known depth, it gets
> ugly quickly, and nesting to an arbitrary depth is beyond the abi
Hmmm...looks like the RegEx method isn't going to be the holy grail I
had hoped!
Thanks very much for yout time, Maciek.
Marty
--- In flexcoders@yahoogroups.com, Maciek Sakrejda <[EMAIL PROTECTED]> wrote:
>
> Unfortunately, you've hit an ugly problem for regex, Marty. Check out
> the section on
Yeah, that'd be great!
My email is kiwicomposer at hotmail dot com
Thanks Jhonny.
Marty
--- In flexcoders@yahoogroups.com, "Jhonny Everson" <[EMAIL PROTECTED]> wrote:
>
> To solve a similar problem I wrote a lexical analyzer and a parser
in AIR. I
> use it to convert Java code to AS3 to using w
To solve a similar problem I wrote a lexical analyzer and a parser in AIR. I
use it to convert Java code to AS3 to using with remoting. The code is messy
but i can send to you if you want.
--
Jhonny Everson
6 matches
Mail list logo
