|
FE 0.16.1
Fast, Effecient FrontEnds
|
#include <concepts>#include <algorithm>#include <type_traits>#include "fe/assert.h"#include "fe/error.h"#include "fe/format.h"#include "fe/loc.h"#include "fe/ring.h"#include "fe/vector.h"Go to the source code of this file.
Classes | |
| class | fe::Parser< Tok, Tag, K, S > |
The blueprint for a recursive descent/ ascent parser using a K lookahead of Tokens. More... | |
| class | fe::Parser< Tok, Tag, K, S >::Tracker |
| struct | fe::Parser< Tok, Tag, K, S >::Anchor |
| One anchor; the left end opened the context, the right one is what it is still waiting for. More... | |
| class | fe::Parser< Tok, Tag, K, S >::ScopedAnchor |
| RAII helper that pushes a Parser::Anchor for its lifetime; use Parser::anchor to build one. More... | |
| struct | fe::Parser< Tok, Tag, K, S >::Expected |
| What Parser::expect was after - a Tag, or free-form markup. More... | |
Namespaces | |
| namespace | fe |
Concepts | |
| concept | fe::Token |
| What fe::Parser needs of its Token type: a Tag and a Loc, copied in and out of the lookahead by value. | |
| concept | fe::Lexable |
What fe::Parser needs of its CRTP child S beyond fe::Diagnosable: the Lexer to pull Tokens from. | |
| struct fe::Parser::Anchor |