[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
RE: time in invoking the Lex Yacc parser
From: |
Ajithkrishnan VP |
Subject: |
RE: time in invoking the Lex Yacc parser |
Date: |
Tue, 14 Aug 2001 17:52:29 +0530 |
Instead of parsing the entire file ,if I parse for a logical end, return to
the calling function(the function which calls the parser),do some processing
and then call the parser again by using the same file pointer will I be able
to get the same level of performance?
-----Original Message-----
From: John W. Millaway [mailto:address@hidden
Sent: Tuesday, August 14, 2001 5:49 PM
To: Ajithkrishnan VP; address@hidden
Subject: Re: time in invoking the Lex Yacc parser
> parser itself and continue.The issue here is whether invoking the parser a
> 100 times is more costlier(timewise) than invoking it once and completing
> the flow a hundred times inside the parser.And if there is big difference
in
> time what are the orders of magnitude?
The answer is architecture-dependent. If you're worried about saving cycles
at
that level, you should be using a profiler.
$ gcc -pg -O3 parser.c -o parser
$ ./parser
$ gprof
__________________________________________________
Do You Yahoo!?
Make international calls for as low as $.04/minute with Yahoo! Messenger
http://phonecard.yahoo.com/