ANTLR Section Index | Page 8

Can I do (one-pass) code generation with a tree parser? What is the normal code generation strategy?

Does ANTLR always backtrack if I use a syntactic predicates?

How can I return a tree via the return value mechanism (instead of the automatic AST construction mechanism) and access it in an invoking rule?

How do I build my parser in C++?

How do I handle #include files or other nested input streams?

How do I process or examine each token consumed by the parser?

How do I propagate/copy a type tree to multiple declarators of a variable declaration?

How do I recognize identifiers that can start with a number?

How do I track column and line information?

I need to see what rules my parser is using, and need to know if there is a simple debugging option like the -gd option to antlr in v1.33? Or, I have no idea what is wrong with my parser/lexer; what can I do?

I want the information from a syntactic predicate but don't want to select an alternative.

What changes do I need to make to generate C++?

Why can't the parser tell the lexer exactly what to go get? (why can't the parser give context information to the lexer to decide what kind of token will be coming down the input stream?)

Why do lexical rules for keywords conflict with identifiers even if I specify the special case (keywords) before the more general identifier rule?

Why doesn't my definition of string or comment does not match all characters in my input or why aren't my tokens defined by string literals matched by the lexer?

About | Sitemap | Contact