Simple parser question...

[leaf]

How do i make a simple parser that parse strings
ex.
"string1 string2 string3"
and store in a vector?

how can it be done using BOOST.Spirit?

---
leaf

[Hippo]

need BOOST.Spirit?just using strtok
modify the MSDN simple
char string1[] = "string1 string2 string3";
char seps[] = " ";
char *token;
vector<string >(temp)
void main( void )
{
printf( "%s\n\nTokens:\n", string1 );
/* Establish string and get the first token: */
token = strtok( string1, seps );
while( token != NULL )
{
/* While there are tokens in "string1" */
printf( " %s\n", token );
temp.push_back(token);
/* Get next token: */
token = strtok( NULL, seps );
}
}

[leaf]

tried it and it worked.

but my actual implementation is something like parsing:
"public: __thiscall unsigned int FunctionName( type, type, type ... )"

---
leaf

[Hippo]

the array seps to separate the string can stroe a few characters .so ur
string can aslo be parsing.

[Daniel T.]

In article <11**********************@p10g2000cwp.googlegroups .com>,
"Hippo" <hi*******@hotmail.com> wrote:

need BOOST.Spirit?just using strtok
modify the MSDN simple
char string1[] = "string1 string2 string3";
char seps[] = " ";
char *token;
vector<string >(temp)
void main( void )
{
printf( "%s\n\nTokens:\n", string1 );
/* Establish string and get the first token: */
token = strtok( string1, seps );
while( token != NULL )
{
/* While there are tokens in "string1" */
printf( " %s\n", token );
temp.push_back(token);
/* Get next token: */
token = strtok( NULL, seps );
}
}

That looks like too much work to me, all to use a rather dangerous
function.

How about this instead:

void fn( const string& in, vector<string>& vec )
{
istringstream iss( in );
copy( istream_iterator<string>( iss ), istream_iterator<string>(),
back_inserter( vec ) );
}
--
Magic depends on tradition and belief. It does not welcome observation,
nor does it profit by experiment. On the other hand, science is based
on experience; it is open to correction by observation and experiment.

[leaf]

What bothers me is the problem of ensuring that the strings that are
push'ed inside the vector are correct.
consider this string "public: __thiscall unsigned int
Class::FunctionName( type, type, type ... )"
Using Hippo's code the problem was solved but one still remained the
"Class::Function" whereas they should be seperated.

BTW, what i'm doing is is pushing the elements of a function prototype.
( extracted from a DLL )

Problem is when Return Types are "unsigned int" etc.

Another problem arise when the prototype is rather incomplete (
elements in the vector position is very important )
Regards,
leaf

[Daniel T.]

In article <11*********************@v46g2000cwv.googlegroups. com>,
"leaf" <ad********@gmail.com> wrote:

What bothers me is the problem of ensuring that the strings that are
push'ed inside the vector are correct.
consider this string "public: __thiscall unsigned int
Class::FunctionName( type, type, type ... )"
Using Hippo's code the problem was solved but one still remained the
"Class::Function" whereas they should be seperated.

BTW, what i'm doing is is pushing the elements of a function prototype.
( extracted from a DLL )

Problem is when Return Types are "unsigned int" etc.

Another problem arise when the prototype is rather incomplete (
elements in the vector position is very important )

Are you trying to parse c++ code in general? I suggest you buy or get a
tool then...

--
Magic depends on tradition and belief. It does not welcome observation,
nor does it profit by experiment. On the other hand, science is based
on experience; it is open to correction by observation and experiment.

[leaf]

Not really, i mean i need to parse the DLL from my own application. The
information (stored in vectors) should be inside the application
because later it will be used as a reference table...

[Default User]

leaf wrote:

How do i make a simple parser that parse strings
ex.
"string1 string2 string3"
and store in a vector?

What kind of delimiters do you want, characters or strings? What should
be done with adjacent delimiters, should the merge (strtok() style, or
insert a 0-length string?

These are important questions before the nuts and bolts of a solution
can be derived.
Brian

--
Please quote enough of the previous message for context. To do so from
Google, click "show options" and use the Reply shown in the expanded
header.

[leaf]

I see, all i need to to is to parse the 'function prototype string'
store it in a vector,
to be specific :
std::vector<stFunction> fun; // FunctionStruct
....
struct stFunction{
// simple variable spec
enum eVarType{
VAR_VOID, VAR_BOOL, VAR_INT, VAR,
};
// possible calling conventions
enum eCallType{
CALL_CDECL, CALL_STDCALL, CALL_THISCALL,
};
typedef std::vector<eVarType> ParamVec;

void* m_Proc;
eVarType m_ReturnType;
ParamVec m_ParamTypes;
eCallType m_CallType;
std::string m_Name;
};

There, from the string say:
"public: void __thiscall MyClass::MyFunc(unsigned int, unsigned int)"
stFunction structure will be filled...

---
Young Leaf

Ayon kay Default User:

leaf wrote:

How do i make a simple parser that parse strings
ex.
"string1 string2 string3"
and store in a vector?

What kind of delimiters do you want, characters or strings? What should
be done with adjacent delimiters, should the merge (strtok() style, or
insert a 0-length string?

These are important questions before the nuts and bolts of a solution
can be derived.
Brian

--
Please quote enough of the previous message for context. To do so from
Google, click "show options" and use the Reply shown in the expanded
header.

[Daniel T.]

In article <11**********************@u72g2000cwu.googlegroups .com>,
"leaf" <ad********@gmail.com> wrote:

I see, all i need to to is to parse the 'function prototype string'
store it in a vector,
to be specific :
std::vector<stFunction> fun; // FunctionStruct
...
struct stFunction{
// simple variable spec
enum eVarType{
VAR_VOID, VAR_BOOL, VAR_INT, VAR,
};
// possible calling conventions
enum eCallType{
CALL_CDECL, CALL_STDCALL, CALL_THISCALL,
};
typedef std::vector<eVarType> ParamVec;

void* m_Proc;
eVarType m_ReturnType;
ParamVec m_ParamTypes;
eCallType m_CallType;
std::string m_Name;
};

There, from the string say:
"public: void __thiscall MyClass::MyFunc(unsigned int, unsigned int)"
stFunction structure will be filled...

Start with a test:

void fn() {
stFunction out = parse( "int main()" );
assert( out.eVarType == VAR_INT );
// etc... for the other asserts.
}

int main() {
fn();
cout << "working\n";
}

Take the above and start writing code until it will compile, then write
more code until none of the asserts fire. Then write a slightly more
complicated test and repeat.

For an example, do a google group search for ["a Recursive Descent
Parser via TDD" phlip]
--
Magic depends on tradition and belief. It does not welcome observation,
nor does it profit by experiment. On the other hand, science is based
on experience; it is open to correction by observation and experiment.