Parsarea tipurilor de date compuse ale limbajului de programare C

Abstract

In this thesis, an algorithm was developed to parse composite data types and their declarations in C program snippets. The declarations are then transformed into syntax tree nodes, which allow the compiler to decide which operations can be applied to them. For educational purposes, a visual program was also developed to illustrate how a syntax tree is seen from the point of view of a compiler.