Simple BNF grammar for demonstration
up vote
-2
down vote
favorite
I need to write a simple grammar in BNF for a demonstration on how to create a parser in Java. What i'm trying to achieve is to make the parser able to read a file of the following type:
NET anystringNet {
anystring
}
The first NET is a mandatory keyword, anystringNet represent anystring that ends with the suffix Net, and inside the braces there can be any string repeated from 0 to infinite times.
The fact is that I've never had grammar classes, I tried to follow online tutorials but I have very little time to achieve this. Any help is appreciated, thanks.
parsing bnf
asked Nov 22 at 13:41
yawg567
11
add a comment |
up vote
-2
down vote
favorite
I need to write a simple grammar in BNF for a demonstration on how to create a parser in Java. What i'm trying to achieve is to make the parser able to read a file of the following type:
NET anystringNet {
anystring
}
The first NET is a mandatory keyword, anystringNet represent anystring that ends with the suffix Net, and inside the braces there can be any string repeated from 0 to infinite times.
The fact is that I've never had grammar classes, I tried to follow online tutorials but I have very little time to achieve this. Any help is appreciated, thanks.
parsing bnf
asked Nov 22 at 13:41
yawg567
11
add a comment |
up vote
-2
down vote
favorite
up vote
-2
down vote
favorite
I need to write a simple grammar in BNF for a demonstration on how to create a parser in Java. What i'm trying to achieve is to make the parser able to read a file of the following type:
NET anystringNet {
anystring
}
The first NET is a mandatory keyword, anystringNet represent anystring that ends with the suffix Net, and inside the braces there can be any string repeated from 0 to infinite times.
The fact is that I've never had grammar classes, I tried to follow online tutorials but I have very little time to achieve this. Any help is appreciated, thanks.
parsing bnf
asked Nov 22 at 13:41
yawg567
11
I need to write a simple grammar in BNF for a demonstration on how to create a parser in Java. What i'm trying to achieve is to make the parser able to read a file of the following type:
NET anystringNet {
anystring
}
The first NET is a mandatory keyword, anystringNet represent anystring that ends with the suffix Net, and inside the braces there can be any string repeated from 0 to infinite times.
The fact is that I've never had grammar classes, I tried to follow online tutorials but I have very little time to achieve this. Any help is appreciated, thanks.
parsing bnf
parsing bnf
asked Nov 22 at 13:41
yawg567
11
asked Nov 22 at 13:41
yawg567
11
asked Nov 22 at 13:41
yawg567
11
asked Nov 22 at 13:41
yawg567
11
asked Nov 22 at 13:41
yawg567
11
11
add a comment |
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53432284%2fsimple-bnf-grammar-for-demonstration%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
