I'm trying to use the ast module in Python 3 to parse some Python code.
For now I'm only coding a simple node visitor that will output the original code.
I have difficulties to convert some nodes of ...

Due to the nature of top down parsing, ANTLR generates parse trees with some long repetitive structures with a lot of superfluous nodes before reaching a leaf inside expressions.
For example, using ...

While parsing source file using grammar by bisonc++, I want to get line number of token. For this I've enabled %lsp-needed. Now when I'm accessing the line number using @1.first_line and @1.last_line, ...

So, I'm given an assignment of constructing an AST right from scratch. So far, I've defined the grammar by using ANTLR 4, but since it doesn't support ASTs any longer (deprecated from ANTLR 4), what ...

We can use small letters for terminals and caps for Non-terminals in JFLAP while entering grammar. But this restricts to only 26 options.
Can we have more symbols?
Are there any alternatives to JFLAP ...

I'm trying to parse a simple language. The trouble comes with parsing function calls. I'm trying to tell it that a function call is an expression followed by left parenthesis, argument list, and right ...

I'm writing a GoldParser VBScript grammar. In my grammar array assignment statements such as id(1) = 2 are not parsed as assignment statements, but as call statments id ((1) = 2) (the = symbol can be ...

I'm working on Xtext project and I want to have a grammar that would allow me to:
1. String quotes from strings, ex: "string" -> string
2. Allow to consider a string chunks separated with spaces as ...

I'm no expert in grammars, but I want to write a CPLEX Parser (which is a LP syntax) in CoreParse [1]. But CoreParse is unable to build the following grammar and exits with a stack overflow instead of ...

I've began to read about LR(k) parse table construction, and all texts explaining the algorithm for k > 0 suggest that the lookaheads should be calculated for every symbol before generating the item ...

I'm using some parser and lexer generating tools (similar to Lex and Bison, but for C#) to generate programs that parse strings into abstract syntax trees that can later be evaluated.
I wanted to do ...

I have defined multiple rules in XML for C#. The file is loaded and RecognizeAsync(RecognizeMode.Multiple) is eventually called for what I hope to become continuous recognition. The SpeechRecognized ...

I wish to code fully with Esperanto lexemes. That is, not ending up with a English/Esperanto mix up. Perligata is a good example of the kind of result I would like, but it use Latin where I want to ...