(→CDK Nodes) |
(→CDK Nodes) |
||
Line 11: | Line 11: | ||
* '''basic_node''' -- base class for all nodes: provides information about the program location (code line) | * '''basic_node''' -- base class for all nodes: provides information about the program location (code line) | ||
− | * sequence_node -- node for representing sequences of other nodes | + | * '''sequence_node''' -- node for representing sequences of other nodes |
− | * typed_node -- node for typed entities (any entity that has a type): main subclasses are are '''expression_node''', '''lvalue_node''', and (in specific compilers) '''declaration_nodes''' (also definitions) | + | * '''typed_node''' -- node for typed entities (any entity that has a type): main subclasses are are '''expression_node''', '''lvalue_node''', and (in specific compilers) '''declaration_nodes''' (also definitions) |
− | * expression_node -- superclass for all nodes representing some kind of expression (i.e., nodes that represent some value) | + | * '''expression_node''' -- superclass for all nodes representing some kind of expression (i.e., nodes that represent some value) |
=== Expressions === | === Expressions === | ||
− | * binary_operation_node -- abstract node for describing binary operations | + | * '''binary_operation_node''' -- abstract node for describing binary operations |
− | ** add_node sub_node mul_node div_node mod_node -- binary arithmetic operations | + | ** '''add_node''' '''sub_node''' '''mul_node''' '''div_node''' '''mod_node''' -- binary arithmetic operations |
− | ** and_node or_node -- binary logical operations | + | ** '''and_node''' '''or_node''' -- binary logical operations |
− | ** lt_node le_node ge_node gt_node -- relational operations | + | ** '''lt_node''' '''le_node''' '''ge_node''' '''gt_node''' -- relational operations |
− | ** eq_node ne_node -- equality operations | + | ** '''eq_node''' '''ne_node''' -- equality operations |
− | * unary_operation_node -- abstract node for describing unary operations | + | * '''unary_operation_node''' -- abstract node for describing unary operations |
− | ** not_node | + | ** '''not_node''' '''neg_node''' -- miscellaneous unary operations |
=== Left-Values === | === Left-Values === | ||
Line 34: | Line 34: | ||
=== Literals === | === Literals === | ||
− | * literal_node -- node that represents generic literal nodes | + | * '''literal_node''' -- node that represents generic literal nodes |
− | ** double_node integer_node string_node -- specific literal nodes | + | ** '''double_node''' '''integer_node''' '''string_node''' -- specific literal nodes |
=== Other Nodes === | === Other Nodes === | ||
− | data_node -- opaque data node | + | * '''data_node''' -- opaque data node |
− | nil_node -- node for representing emptiness | + | * '''nil_node''' -- node for representing emptiness |
== Simple Nodes == | == Simple Nodes == |
AVISOS - Avaliação em Época Normal |
---|
Esclarecimento de dúvidas:
|
Requisitos para desenvolvimento, material de apoio e actualizações do enunciado (ver informação completa em Projecto de Compiladores):
|
Processo de avaliação (ver informação completa em Avaliação do Projecto):
|
Material de Uso Obrigatório |
---|
As bibliotecas CDK e RTS de apoio ao desenvolvimento do projecto são de uso obrigatório: |
|
A máquina virtual, fornecida para desenvolvimento do projecto, já contém todo o material de apoio. |
Uso Obrigatório: Repositório GIT |
Apenas se consideram para avaliação os projectos existentes no repositório GIT oficial. Apenas se considera para avaliação o ramo main.
Trabalhos não presentes no repositório no final do prazo têm classificação 0 (zero) (não são aceites outras formas de entrega). Não são admitidas justificações para atrasos em sincronizações do repositório. A indisponibilidade temporária do repositório, desde que inferior a 24 horas, não justifica atrasos na submissão de um trabalho. |
CDK is the basis for compiler development in this setup. Simple is a small compiler based on the CDK.
This page focuses on the nodes, that is, the language elements present in each package. CDK nodes tend to be general, in the sense that the concepts are reusable accross different languages. Simple provides nodes specific to the implemented language.