antlrworks Questions

3

Solved

I'm creating my first grammar with ANTLR and ANTLRWorks 2. I have mostly finished the grammar itself (it recognizes the code written in the described language and builds correct parse trees), but I...
Clinician asked 19/4, 2013 at 10:28

2

Solved

I'm using ANTLR to parse logical expressions in a Java tool I'm writing, and I'm having issues because passing invalid input strings to the generated ANTLR lexer and parser doesn't cause any except...
Criswell asked 28/12, 2011 at 16:47

2

Solved

I have written a grammar for vaguely Java-like DSL. While there are still some issues with it (it doesn't recognize all the inputs as I would want it to), what concerns me most is that the generate...
Elisabetta asked 18/11, 2013 at 20:20

4

Solved

I have been using ANTLR with Eclipse for some time using the ANTLRv3IDE plugin. While it is not perfect, and a bit outdated, it does its job reasonably well. Now I am looking to switch to ANTLRv4 ...
Culm asked 22/6, 2013 at 20:21

1

I have written a grammar but getting a left recursive error. grammar Lang; options { output = AST; language = C; ASTLabelType= pANTLR3_BASE_TREE; backtrack = true; } start : primary_expressi...
Salbu asked 22/2, 2013 at 7:26

1

Solved

The TestDriver in ANTLRWorks2 seems kind of finicky about when it'll accept a grammer without and explicit EOF and when it will not. The Hello grammar in the ANTLR4 Getting Started Guide doesn't us...
Veinstone asked 24/7, 2013 at 20:31

3

Solved

The recommended pattern for ANTLR usage is to have the Parser construct an Abstract Syntax Tree, and then build Tree walkers (AKA tree grammars) to process them. I'm trying to get to the bottom of...
Whelm asked 13/10, 2009 at 16:45

2

Solved

Are there any common solutions how to use incomplete grammars? In my case I just want to detect methods in Delphi (Pascal)-files, that means procedures and functions. The following first attempt is...
Whither asked 26/8, 2011 at 11:12

1

Solved

According to these instructions, I'm trying to use ANTLR generated *.as files in a current Flash Builder 4.5.1 project. Therefore, I added this ANTLR's Actionscript runtime to my project - without...
Hunks asked 22/6, 2011 at 22:45

1

Solved

I'm trying to create a very simple grammar to learn to use ANTLR but I get the following message: "The following alternatives can never be reached: 2" This is my grammar attempt: grammar Robot...
Sextillion asked 10/6, 2011 at 19:22

1

Solved

I'm having trouble figuring out the antlr3 API so I can generate and use a parse tree in some javascript code. When I open the grammar file using antlrWorks (their IDE), the interpreter is able to ...
Alpert asked 12/5, 2011 at 16:24

1

Solved

I am trying to get my head around the tree construction operators (^ and !) in ANTLR. I have a grammar for flex byte arrays (a UINT16 that describe number of bytes in array, followed by that many ...
Femur asked 27/4, 2011 at 21:22

1

My question is in regards to running the following grammar in ANTLRWorks: INT :('0'..'9')+; SEMICOLON: ';'; NEWLINE: ('\r\n'|'\n'|'\r'); STMTEND: (SEMICOLON (NEWLINE)*|NEWLINE+); statement : STM...
Attar asked 17/4, 2011 at 20:56

1

Solved

I was having difficulty figuring out what does ^ and ! stand for in ANTLR grammar terminology.
Proudfoot asked 12/8, 2010 at 9:45

2

Solved

For a pet project I started to fiddle with ANTLR. After following some tutorials I'm now trying to create the grammar for my very own language and to generate an AST. For now I'm messing around in...
Synchro asked 18/5, 2010 at 11:8

2

Solved

Hey. I'm new to ANTLR. ANTLRWorks wizard wrrited for me the following code: grammar test; ID : ('a'..'z'|'A'..'Z'|'_') ('a'..'z'|'A'..'Z'|'0'..'9'|'_')* ; INT : '0'..'9'+ ; FLOAT : ('0'..'9'...
Auricle asked 16/12, 2009 at 20:52

2

Solved

What is the correct way to solve this problem in ANTLR: I have a simple grammar rule, say for a list with an arbitrary number of elements. list : '[]' | '[' value (COMMA value)* ']' If I wante...
Makowski asked 17/4, 2009 at 4:29
1

© 2022 - 2024 — McMap. All rights reserved.