Re: Parsing Ada?

["J-P. Rosen" <rosen@adalog.fr>]

Le 03/06/2015 09:58, Stephen Leake a écrit :
> As Dmitry points out, writing a recursive descent parser for a subset of
> Ada should not be hard.
But there is a lot more than parsing if you want to do any serious
analysis of Ada code. Consider:

A(B)

This could be a function call, an array indexing, an indexing of an
implicit dereference, an indexing of the result of a (parameterless)
function call... Sorting that out requires full overloading resolution -
a lot harder than parsing.

-- 
J-P. Rosen
Adalog
2 rue du Docteur Lombard, 92441 Issy-les-Moulineaux CEDEX
Tel: +33 1 45 29 21 52, Fax: +33 1 45 29 25 00
http://www.adalog.fr