Lines Matching refs:semantic
584 tokens represent semantic information and are produced by the parser, replacing
632 don't contain any semantic information about the lexed value. For example, if
649 semantic information found by the parser. For example, if "``foo``" is found
654 reparse does not need to redo semantic analysis to determine whether a token
820 Typedefs in C make semantic analysis a bit more complex than it would be without
864 with this: first, various semantic checks need to make judgements about the
1071 semantics. The two views are kept synchronized by semantic analysis while
1141 declarations of "``g``". Clients that perform semantic analysis on a program
1152 declaration context, and a *semantic* context, which corresponds to the
1154 ``Decl::getLexicalDeclContext`` while the semantic context is accessible via
1165 Here, the semantic and lexical contexts of ``X::f`` are the ``DeclContext``
1173 This definition of "``f``" has different lexical and semantic contexts. The
1180 The semantic context of ``X::f`` corresponds to the class ``X``, since this
1235 transparent ``DeclContext`` itself, as will the semantic context, but the
1296 each namespace definition are effectively merged (from the semantic point of
1408 After invoking the parser+semantic analyzer on this code fragment, the AST of
1508 to constant fold the constants, to do semantic checks (e.g., verify bitfield
1530 Finally, this is not just a problem for semantic analysis. The code generator
1608 do semantic analysis of the input. For valid programs, Sema builds an AST for
1625 allowing the programmer to pass semantic information along to the compiler for
1627 for a program construct, or to provide extra semantic information for static
1635 representation, conversion from a parsed attribute into a semantic attribute,
1636 and then the semantic handling of the attribute.
1650 into a semantic attribute. The process by which a parsed attribute is converted
1651 into a semantic attribute depends on the attribute definition and semantic
1652 requirements of the attribute. The end result, however, is that the semantic
1656 The structure of the semantic attribute is also governed by the attribute
1660 semantic checking for some attributes, etc.
1669 semantic) type, or one of its derivatives. Most attributes will derive from the
1682 semantic name of the attribute, the spellings the attribute supports, the
1691 which the attribute can be spelled. For instance, a single semantic attribute
1794 attribute. Attribute arguments specify both the parsed form and the semantic
1799 semantic attribute will require a string and integer argument.
1815 semantic form, the ``HasCustomParsing`` bit can be set to ``1`` for the class,
1822 Note that setting this member to 1 will opt out of common attribute semantic
1833 other attributes generate an AST node by default. The AST node is the semantic
1847 These accessors will be generated on the semantic form of the attribute,
1850 Attributes that do not require custom semantic handling should set the
1852 ``IgnoredAttr`` automatically do not get a semantic handler. All other
1853 attributes are assumed to use a semantic handler by default. Attributes
1854 without a semantic handler are not given a parsed attribute ``Kind`` enumerator.
1858 attribute spelled ``GNU<"interrupt">``, but with different parsing and semantic
1863 attributes to share a parsed attribute kind, but have distinct semantic
1866 semantic attributes generated.
1878 If additional functionality is desired for the semantic form of the attribute,
1880 semantic attribute class object, with ``public`` access.
1884 All semantic processing of declaration attributes happens in `lib/Sema/SemaDeclAttr.cpp
1887 attribute is a "simple" attribute -- meaning that it requires no custom semantic
1894 Unless otherwise specified by the attribute definition, common semantic checking
1907 All semantic diagnostics generated for your attribute, including automatically-
1914 instance, to modify the way code is generated, or to add extra semantic checks
1916 to the semantic representation for the attribute, what remains is to implement
1920 attribute using ``hasAttr<T>()``. To obtain a pointer to the semantic
1927 compiler, because they interact with many different parts of the AST, semantic
1947 #. Introduce semantic analysis actions into ``Sema``. Semantic analysis should
1950 actual semantic analysis and will (eventually!) build the AST node. It's
1955 variant. Several notes on semantic analysis before we get into construction
2007 #. Teach semantic analysis to build your AST node. At this point, you can wire
2015 return a C++ class with a private destructor: semantic analysis should
2043 expects, STOP! Go fix semantic analysis and the AST so that you don't
2078 semantic analysis and build your expression.