Age | Commit message (Collapse) | Author |
|
|
|
This makes it more symmetrical with adopt_own() (which is used to
create a NonnullOwnPtr from the result of a naked new.)
|
|
SPDX License Identifiers are a more compact / standardized
way of representing file license information.
See: https://spdx.dev/resources/use/#identifiers
This was done with the `ambr` search and replace tool.
ambr --no-parent-ignore --key-from-file --rep-from-file key.txt rep.txt *
|
|
|
|
This type represents templatized names, and replaces our previous use
of 'TemplatizedType' and 'TemplatizedFunctionCall'.
Also, we now parse function calls as secondary expressions.
|
|
This allows us to use pase_* methods inside match_* methods,
without adding any actual AST nodes to the m_nodes list.
|
|
|
|
|
|
|
|
parse static_cast, reinterpret_cast, dynamic_cast & const_cast
|
|
|
|
A Name node is basically an identifier with an optional scope,
e.g Core::File.
|
|
We can now parse things like Vector<int>
|
|
|
|
|
|
|
|
Also, remove unused State::Context
|
|
.. definitions.
|
|
After we moved to storing the text of each token in the token itself,
we no longer have to store the source of the program in the Parser.
This makes more sense because the parser should deal with tokens, not
with raw source code.
|
|
It was previously implemented by directly iterating over the program's
source.
|
|
|
|
|
|
We can now parse the printf function declaration :^)
|
|
Consume __atribute__(...), without actually parsing its content.
|
|
|
|
As part of the position information, we now also store the filename the
ASTNode belongs to.
|
|
|
|
We now also look at the available declarations from included header
files when autocompleting names.
Additionally, you can now request autocomplete on an empty token, which
brings up all available names, starting from the inner-most scope.
|
|
|
|
This parser will be used by the C++ langauge server to provide better
auto-complete (& maybe also other things in the future).
It is designed to be error tolerant, and keeps track of the position
spans of the AST nodes, which should be useful later for incremental
parsing.
|