Darshal Shetty 20b272446f Let variables (#1095) 4 роки тому
..
BUILD 7cce1bd124 interfaces, impls, and constrained generics (basics) (#1073) 4 роки тому
README.md 7cce1bd124 interfaces, impls, and constrained generics (basics) (#1073) 4 роки тому
ast.h f75b4d322f Handle use-before-declare in static name lookup (#967) 4 роки тому
ast_node.cpp 7a5b8434c8 Define a base class for all AST nodes. (#947) 4 роки тому
ast_node.h 8e6c209a28 Use resolved names in typechecker (#974) 4 роки тому
ast_rtti.txt 20b272446f Let variables (#1095) 4 роки тому
ast_test_matchers.h dc5e62fc7a Support parsing and testing unimplemented expressions (#957) 4 роки тому
ast_test_matchers_internal.cpp 92903afbd5 clang-tidy pass on executable_semantics (#963) 4 роки тому
ast_test_matchers_internal.h 92903afbd5 clang-tidy pass on executable_semantics (#963) 4 роки тому
ast_test_matchers_test.cpp ac0b810bf3 Adds basic support for class functions and methods. (#1057) 4 роки тому
declaration.cpp 7cce1bd124 interfaces, impls, and constrained generics (basics) (#1073) 4 роки тому
declaration.h 20b272446f Let variables (#1095) 4 роки тому
expression.cpp 2325c50b3b Support for `if ... then ... else` following #911. (#944) 4 роки тому
expression.h 2325c50b3b Support for `if ... then ... else` following #911. (#944) 4 роки тому
expression_test.cpp eda43faa5a Note namespace and static recommendations in C++ style guide (#1041) 4 роки тому
generic_binding.h 7cce1bd124 interfaces, impls, and constrained generics (basics) (#1073) 4 роки тому
library_name.h a03536a196 Add syntax for package and library (#792) 4 роки тому
paren_contents.h bb28d37eed Drop support for named tuple fields (#886) 4 роки тому
pattern.cpp 20b272446f Let variables (#1095) 4 роки тому
pattern.h 20b272446f Let variables (#1095) 4 роки тому
pattern_test.cpp eda43faa5a Note namespace and static recommendations in C++ style guide (#1041) 4 роки тому
return_term.h 7cce1bd124 interfaces, impls, and constrained generics (basics) (#1073) 4 роки тому
source_location.h 6ae85bd13a Initial batch of AST matchers. (#953) 4 роки тому
statement.cpp 50263483d8 Add name accessor to NamedEntityView (#994) 4 роки тому
statement.h 20b272446f Let variables (#1095) 4 роки тому
static_scope.cpp 7cce1bd124 interfaces, impls, and constrained generics (basics) (#1073) 4 роки тому
static_scope.h 7cce1bd124 interfaces, impls, and constrained generics (basics) (#1073) 4 роки тому
value_category.h c89ce1d570 Handle identifier value category properly. (#986) 4 роки тому

README.md

The code in this directory defines the AST that represents Carbon code in the rest of executable-semantics.

The AST is not quite immutable, because some node properties are set during some phase of static analysis, rather than during parsing. However, AST mutations are monotonic: once set, a node property cannot be changed. Furthermore, if a property is set after parsing, its documentation specifies what phase is responsible for setting it. Certain properties have has_foo() members for querying whether they are set, but those are for internal use within the phase that sets them. As a result, you can think of the AST as if it were immutable, but with certain parts that you can't yet observe, depending on what phase of compilation you're in.

All node types in the AST are derived from AstNode, and use LLVM-style RTTI to support safe down-casting and similar operations. Each abstract class Foo in the hierarchy has a kind method which returns a enum FooKind that identifies the concrete type of the object, and a FooKind value can be safely static_casted to BarKind if that value represents a type that's derived from both Foo and Bar.

We rely on code generation to help enforce those invariants, so every node type must be described in ast_rtti.txt. See the documentation in (gen_rtti.py)[../gen_rtti.py], the code generation script, for details about the file format and generated code.

The AST class hierarchy is structured in a fairly unsurprising way, with abstract classes such as Statement and Expression, and concrete classes representing individual syntactic constructs, such as If for if-statements.

Sometimes it is useful to work with a subset of node types that "cuts across" the primary class hierarchy. Rather than deal with the pitfalls of multiple inheritance, we handle these cases using a form of type erasure: we specify a notional interface that those types conform to, and then define a "view" class that behaves like a pointer to an instance of that interface. Types declare that they model an interface Foo by defining a public static member named ImplementsCarbonFoo. See ValueNodeView for an example of this pattern.