[cfe-dev] Recursive Descent Parser

[Nikola Smiljanic]

I'm not sure what Raghvan is trying to achieve but I don't think the graph
would be very helpful. Grammar productions are available in Annex A of the
standard (if that's all he's after) but AFAIK clang's parser doesn't map
1:1 to them.

On Thu, Sep 25, 2014 at 7:47 AM, Daniel Dilts <diltsman at gmail.com> wrote:

> I suppose that someone could write a utility using Clang to dump the call
> graph starting at the base rule.
>
>
> On Wed, Sep 24, 2014 at 2:31 PM, Nikola Smiljanic <popizdeh at gmail.com>
> wrote:
>
>> I don't think there is. Have a look at clang::ParseAST. it keeps track of
>> the callstack in case of crash. It also keeps track of some statistics but
>> I think that's all there is.
>>
>> On Sun, Sep 21, 2014 at 9:55 AM, Raghavan <raghavan97 at yahoo.co.in> wrote:
>>
>>>  Hi,
>>>
>>>
>>>
>>> I am a newbie to clang and LLVM.
>>>
>>>
>>>
>>> I realize that the clang uses Recursive descent parsing for compiling a
>>> c file.
>>>
>>>
>>>
>>> I was wondering, if there is any way to print the production rules or
>>> any kind of parser related details during the parsing of a C file by clang.
>>>
>>>
>>>
>>>
>>>
>>> Thanks.
>>>
>>>
>>>
>>> Bye,
>>>
>>> Raghavan V
>>>
>>>
>>>
>>> _______________________________________________
>>> cfe-dev mailing list
>>> cfe-dev at cs.uiuc.edu
>>> http://lists.cs.uiuc.edu/mailman/listinfo/cfe-dev
>>>
>>>
>>
>> _______________________________________________
>> cfe-dev mailing list
>> cfe-dev at cs.uiuc.edu
>> http://lists.cs.uiuc.edu/mailman/listinfo/cfe-dev
>>
>>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.llvm.org/pipermail/cfe-dev/attachments/20140925/fd35ac55/attachment.html>