Changeset d93b813 for doc/theses/jiada_liang_MMath/CFAenum.tex

Timestamp:

Sep 9, 2024, 6:15:53 PM (36 hours ago)

Author:

JiadaL <j82liang@…>

Branches:

master

Children:

3d618a0

Parents:

478dade

Message:

Add separate compilation discussion

File:

• doc/theses/jiada_liang_MMath/CFAenum.tex (modified) (2 diffs)

doc/theses/jiada_liang_MMath/CFAenum.tex

@@ -147 +147 @@
 const T E_values [3] = { t1, t2, t3 };
 \end{cfa}
-The generated C enumeration will have enumerator values equals to their positions thanks to C's auto-initialization scheme. Notice that value and label arrays are dynamically allocated data structures that take up 
+The generated C enumeration will have enumerator values resemble \CFA enumerator positions thanks to C's auto-initialization scheme.
+A \CFA enumeration variable definition is same in \CFA and C, before or after the transpilation.
+For example:
+\begin{cfa}
+enum E e = E1;
+e;
+\end{cfa}
+These two expressions will not change by \CFA-cc. A \CFA enumeration variable will always have the same underlying representation as its generated 
+C enumeration. This implies \CFA enumeration variable does not take up extra memory and \CFA enumeration use @posn@ as its underlying representation.
+
+Notice that value and label arrays are dynamically allocated data structures that take up 
 memory. If an enumeration is globally defined, the arrays are allocated in the @.data@ section and will be initialized before the program execution.
 Otherwise, if an enumeration has its definition in a local scope, these arrays will be allocated on the stack and be initialized when the program counter 
@@ -212 +222 @@
 
 
-\section{Auto Initialization}
+\section{Initialization}
 \CFA extends C's auto-initialization scheme to \CFA enumeration. For an enumeration type with base type T, the initialization scheme is the following:
 \begin{enumerate}