How parse a string in C++

Question

I want to parse the strings, so that to check whether they have specified syntax or not.

Example:

Str = Z344-R565l t

Here my requirement is after Z there should be a number and after that a - and after that R should be there followed by a number, followed by l, followed by a space and then finally t.

If any thing other than this it should be a error.

I have to parse many different kind of syntax like this. I would be awkward if write a function for each type of syntax required. I heard that yacc or lex can solve this problem.

Can any one please throw some light on my problem?

Suroot · Accepted Answer · 2009-02-18 04:02:52Z

6

You do this with a regex.

Z344-R565l t

Your regex should look something like this. Not sure what regex library to use for c++, but this is the general regex to make sure that your string matches.

Z[0-9]+-R[0-9]+l t

answered Feb 18, 2009 at 4:02

community wiki

Suroot

Sign up to request clarification or add additional context in comments.

2 Comments

dmckee --- ex-moderator kitten Over a year ago

If all of his cases are this easy, he can indeed get away with regexps. But I always cringe from recommending them because people so often try to apply them where they don't belong.

Suroot Over a year ago

Agreed, I think the idea that "I can regex that" is overused. However, in instances like this I think that it would work quite well.

MrEvil · Accepted Answer · 2009-02-18 05:08:08Z

4

Use boost::regex

#include <string>
#include <boost/regex.hpp>

bool isMatch(std::string input){
    boost::regex r("Z[0-9]*-R[0-9]*l t");
    return boost::regex_search(input, r);
}

The other thing that you could do is supply a list of regex expressions in a file, one expression per line. Create a vector of boost::regex objects using the file input and iterate through the vector of patterns for each string you need to validate. It's not very efficient but it will work.

answered Feb 18, 2009 at 5:08

community wiki

MrEvil

Comments

Benoît · Accepted Answer · 2009-02-18 07:42:06Z

4

Boost::Regex is fine if you just want to check the syntax. If you want to actually do something when you read such an expression, i suggest you use Boost::Spirit with something like :

rule<> testFormula = 
    (ch_p('Z') >> int_p) 
    >> (ch_p('-')>>ch_p('R')>>int_p>>ch_p('l')) 
    >> space_p >> ch_p('t');

I have isolated parts of the expression which you might want to connect to some action (using [] operator).

See the documentation for more information

edited Feb 18, 2009 at 7:42

answered Feb 18, 2009 at 6:00

Benoît

17.1k8 gold badges49 silver badges67 bronze badges

Comments

3 revs · Accepted Answer · 2009-07-22 14:54:29Z

1

You might google "runtime parser generation" or something similar...

lex and yacc (or their GNU equivaents flex and bison) do their work at compile time and may not be flexible enough for your needs. (or they may, you're not very specific).

edited Jul 22, 2009 at 14:54

community wiki

3 revs
dmckee

1 Comment

Paul Kelly Over a year ago

lex and yacc is overkill for what you want to do. They are good if you want to build a small programming language.

2 revs, 2 users 78% · Accepted Answer · 2009-07-23 01:22:44Z

1

If you have a recent compiler (VC 2008 SP1, etc.), there's no need to use boost, regex are part of TR1 and you can use them with this header: #include <regex>

Example for a date (you should use double \ as escape character):

string dateorder = "12/07/2009";

tr1::regex expr("^([1-2][0-9]|0?[1-9]|30|31)/([1-9]|10|11|12)/(2\\\d{3})$");

if (!regex_match(dateorder.begin(),dateorder.end(),expr))
{
    ...
    break;  
}

edited Jul 23, 2009 at 1:22

community wiki

2 revs, 2 users 78%
anno

Collectives™ on Stack Overflow

How parse a string in C++

5 Answers 5

2 Comments

Comments

Comments

1 Comment

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

5 Answers 5

2 Comments

Comments

Comments

1 Comment

Comments

Your Answer

Sign up or log in

Post as a guest

Related