Fixed number format in ANTLR

Posted by sarav on Stack Overflow See other posts from Stack Overflow or by sarav
Published on 2010-04-21T08:44:59Z Indexed on 2010/04/21 8:53 UTC
Read the original article Hit count: 403

Filed under:

antlr

|

grammar

How to specify a fixed digit number in antlr grammar?

I want to parse a line which contains fields of fixed number of characters. Each field is a number.

0034|9056|4567|0987|-2340| +345|1000

The above line is a sample line. | indicates field boundaries.

The fields can include blank characters +/-

© Stack Overflow or respective owner

Related posts about antlr

Antlr question: cannot get Antlr tool to compile simple file from ANTLRWorks

as seen on Stack Overflow - Search for 'Stack Overflow'
Here is the grammar file: grammar fred; test : 'fred'; Here is the batch file to launch the tool: SET JAVA_HOME=C:\Program Files\Java\jdk1.6.0_24 SET PATH=%PATH%;%JAVA_HOME%\bin SET ANTLR_HOME=c:/users/don/workspace/antlrAssign/lib/ java -cp %ANTLR_HOME%/antlr-3.3-complete.jar antlr.Tool… >>> More
Improving ANTLR DSL parse-error messages

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm working on a domain-specific language (DSL) for non-programmers. Non-programmers make a lot of grammar mistakes: they misspell keywords, they don't close parentheses, they don't terminate blocks, etc. I'm using ANTLR to generate my parser; it provides a nifty mechanism for handling RecognitionExceptions… >>> More
ANTLR - accessing token values in c/c++

as seen on Stack Overflow - Search for 'Stack Overflow'
Hello, I am trying to parse integers and to access their value in antlr 3.2. I already found out how to do this in Java: //token definition INT : '0'..'9'+; //rule to access token value: start : val=INT {Integer x = Integer.valueOf( $val.text ).intValue(); } ; ... but I couldn't… >>> More
Removing Left Recursion in ANTLR

as seen on Stack Overflow - Search for 'Stack Overflow'
As is explained in http://stackoverflow.com/questions/2652060/removing-left-recursion , there are two ways to remove the left recursion. Modify the original grammar to remove the left recursion using some procedure Write the grammar originally not to have the left recursion What people normally… >>> More
Jar not found when executing class

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi there, I'm working through the ANTLR book and there are many examples that should be easy to compile using the command line. Some information to get te problem: antlr-3.2.jar contains the ANTLR classes. I added the antlr-3.2.jar to the CLASSPATH environment variable (Windows 7) and when compiling… >>> More

Related posts about grammar

Convert The Context Free Grammar to LL1 Grammar

as seen on Stack Overflow - Search for 'Stack Overflow'
hi I want to write a program to gives grammar as input and change it to LL1. my problem is converting to LL1 I don't have any algorithm to convert. I earn grammar from some input text by a simple text analyzer but how I can change it to LL1 ? is there any algorithm that is clear to implement. >>> More
English Grammar Parsing in PHP (Link Grammar)

as seen on Stack Overflow - Search for 'Stack Overflow'
Is there anyway to use the Link Grammar or AbiSource grammar checker in PHP (or C# but I'd prefer php)? I need to have a tree structure for english sentences. Any ideas? The only things I found were in C and I can't use them on a shared host. >>> More
Good grammar for date data type for recursive descent parser LL(1)

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm building a custom expression parser and evaluator for production enviroment to provide a limited DSL to the users. The parser itself as the DSL, need to be simple. The parser is going to be built in an exotic language that doesn't support dynamic expression parsing nor has any parser generator… >>> More
Parsing a string, Grammar file.

as seen on Stack Overflow - Search for 'Stack Overflow'
How would I separate the below string into its parts. What I need to separate is each < Word including the angle brackets from the rest of the string. So in the below case I would end up with several strings 1. "I have to break up with you because " 2. "< reason " (without the spaces) 3. "… >>> More
Efficient Context-Free Grammar parser, preferably Python-friendly

as seen on Stack Overflow - Search for 'Stack Overflow'
I am in need of parsing a small subset of English for one of my project, described as a context-free grammar with (1-level) feature structures (example) and I need to do it efficiently . Right now I'm using NLTK's parser which produces the right output but is very slow. For my grammar of ~450 fairly… >>> More