Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I have two packrat parsers in scala:
val symbols : PackratParser[String] =
"{" | "}" | ">"
val keywords : PackratParser[String] =
"BOOL" | "INT"
I want to build a parser that can recognise if a statement is composed of one or more of those two parsers. The way I’d usually do it is:
val statement : PackratParser[String] =
regex( "[symbols | keywords]+".r )
But that wouldn’t work because they’re thinking I want the actual “symbols” or “keywords” token… Can anyone help?
You can’t use a regex this way. However, the whole point of parser combinators is that they can be combined!