Manfred Dausmann

Learn More
Ada permits the overloading of enumeration literals, aggregates, subprograms and operators, i.e. the declaration of the same designator with different meanings in the same scope. This leads to difficulties during the semantic analysis of expressions and subprogram calls. For selecting the meaning not only the designator but also the types of its operands or(More)
We describe the development of a formal specification of the static semantics of Ada in form of an attribute grammar. This specification is complete, and was tested extensively with automatically generated equivalent Pascal programs. From this specification we systematically developed the semantic analysis part of our Ada Compiler Front End. We outline the(More)
To speed up the development and to facilitate the validation of Ada compilers we propose to use a common LALR(1) grammar for bottom-up parsing. The emphasis in specifying such a grammar especially in removing the conflicts is to obtain the same (syntactic) language as described in the Reference Manual [R-Ada]. In transforming the initial grammar given in(More)