Parsing complex/nested conditions

Previous Topic Next Topic
classic Classic list List threaded Threaded
1 message Options
Reply | Threaded
Open this post in threaded view
Report Content as Inappropriate

Parsing complex/nested conditions

This post has NOT been accepted by the mailing list yet.

I'm writing a language language plugin that defines some of its operator expressions as:
<exp> <compop> <exp>

If i was to implement this directly in the grammar it will be in breach of the left recursion rule. Whats the best way to structure grammar to be able to support this?

(I'm very new to language analysis so any please try to keep any answers simple!:) )