Changes in doc/theses/colby_parsons_MMAth/text/CFA_intro.tex [9509d67a:aae9c17]

File:

• doc/theses/colby_parsons_MMAth/text/CFA_intro.tex (modified) (3 diffs)

doc/theses/colby_parsons_MMAth/text/CFA_intro.tex

@@ -9 +9 @@
 \CFA is a layer over C, is transpiled\footnote{Source to source translator.} to C, and is largely considered to be an extension of C.
 Beyond C, it adds productivity features, extended libraries, an advanced type-system, and many control-flow/concurrency constructions.
-However, \CFA stays true to the C programming style, with most code revolving around @struct@s and routines, and respects the same rules as C.
+However, \CFA stays true to the C programming style, with most code revolving around @struct@'s and routines, and respects the same rules as C.
 \CFA is not object oriented as it has no notion of @this@ (receiver) and no structures with methods, but supports some object oriented ideas including constructors, destructors, and limited nominal inheritance.
 While \CFA is rich with interesting features, only the subset pertinent to this work is discussed here.
@@ -17 +17 @@
 References in \CFA are a layer of syntactic sugar over pointers to reduce the number of syntactic ref/deref operations needed with pointer usage.
 Pointers in \CFA differ from C and \CC in their use of @0p@ instead of C's @NULL@ or \CC's @nullptr@.
-References can contain 0p in \CFA, which is the equivalent of a null reference.
 Examples of references are shown in \VRef[Listing]{l:cfa_ref}.
 
@@ -65 +64 @@
 This feature is also implemented in Pascal~\cite{Pascal}.
 It can exist as a stand-alone statement or wrap a routine body to expose aggregate fields.
-If exposed fields share a name, the type system will attempt to disambiguate them based on type.
-If the type system is unable to disambiguate the fields then the user must qualify those names to avoid a compilation error.
 Examples of the @with@ statement are shown in \VRef[Listing]{l:cfa_with}.