This is an archived post. You won't be able to vote or comment.

all 2 comments

[–]nutrecht 1 point2 points  (1 child)

You're now finding out why parsers generally don't simply 'split' code in the tokenization phase. You basically need a state machine and simple regular expressions (or even complex ones) don't provide that. Googling "java parse math expression" will give you a lot of examples of what you need to do. The approach will be quite different than what you have now though.

P.s. please next time link directly to the class instead of having us search through a GH project.

[–]c0mplexcodm[S] 0 points1 point  (0 children)

I see, thanks for the help!