• Advertisement
Sign in to follow this  

Boost & Spirit : Function Parser

This topic is 4488 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

I'm having trouble writing a rule that will parse the syntax of a Lua function correctly, specifically the list of parameters inside the functions brackets. I suspect I'm putting Spirit into an infinite loop which is causing a crash. A sample of the grammar is below: function = leaf_node_d[ lexeme_d[ alpha_p >> *(alnum_p | ch_p('_')) ] >> ch_p('(') >> !expList >> ch_p(')') ]; expList = list_p(!expression, ch_p(',')); expression = longest_d[real_p | int_p] etc... If anyone knows of some grammar that can parse a simple function syntax I'd be very grateful!

Share this post


Link to post
Share on other sites
Advertisement
Sign in to follow this  

  • Advertisement