Constructing a predictive parser table for this grammar: E:=EE+/EE-/num
0
I have removed the left recursion and left factoring, now the grammar looks like this:
E :=num E''
E'':=EE'E''/epsilon
E':=+/-.
But I am stuck in finding the FOLLOW(E'') and thus cannot further proceed with the problem.
I am learning by myself so please help me if I am making any conceptual mistake.
compiler-construction grammar context-free-grammar
asked Nov 12 '18 at 9:54
Rohit MundadaRohit Mundada
6
add a comment |
0
I have removed the left recursion and left factoring, now the grammar looks like this:
E :=num E''
E'':=EE'E''/epsilon
E':=+/-.
But I am stuck in finding the FOLLOW(E'') and thus cannot further proceed with the problem.
I am learning by myself so please help me if I am making any conceptual mistake.
compiler-construction grammar context-free-grammar
asked Nov 12 '18 at 9:54
Rohit MundadaRohit Mundada
6
Is this input for some program?
– Marichyasana
Nov 12 '18 at 9:58
@Marichyasana I didn't get your question. This is not an input for a program it's just an LL(1) grammar with production rules. And I have to construct a parsing table for it, which in turn checks whether the input is syntactically correct or wrong.
– Rohit Mundada
Nov 12 '18 at 12:58
1
E'' can only be at the end of the sentence, so if you are using an augmented grammar its FOLLOW set is$(or whatever you use for the end token).
– rici
Nov 12 '18 at 15:06
add a comment |
0
0
0
I have removed the left recursion and left factoring, now the grammar looks like this:
E :=num E''
E'':=EE'E''/epsilon
E':=+/-.
But I am stuck in finding the FOLLOW(E'') and thus cannot further proceed with the problem.
I am learning by myself so please help me if I am making any conceptual mistake.
compiler-construction grammar context-free-grammar
asked Nov 12 '18 at 9:54
Rohit MundadaRohit Mundada
6
I have removed the left recursion and left factoring, now the grammar looks like this:
E :=num E''
E'':=EE'E''/epsilon
E':=+/-.
But I am stuck in finding the FOLLOW(E'') and thus cannot further proceed with the problem.
I am learning by myself so please help me if I am making any conceptual mistake.
compiler-construction grammar context-free-grammar
compiler-construction grammar context-free-grammar
asked Nov 12 '18 at 9:54
Rohit MundadaRohit Mundada
6
asked Nov 12 '18 at 9:54
Rohit MundadaRohit Mundada
6
asked Nov 12 '18 at 9:54
Rohit MundadaRohit Mundada
6
asked Nov 12 '18 at 9:54
Rohit MundadaRohit Mundada
6
asked Nov 12 '18 at 9:54
Rohit MundadaRohit Mundada
6
6
Is this input for some program?
– Marichyasana
Nov 12 '18 at 9:58
@Marichyasana I didn't get your question. This is not an input for a program it's just an LL(1) grammar with production rules. And I have to construct a parsing table for it, which in turn checks whether the input is syntactically correct or wrong.
– Rohit Mundada
Nov 12 '18 at 12:58
1
E'' can only be at the end of the sentence, so if you are using an augmented grammar its FOLLOW set is$(or whatever you use for the end token).
– rici
Nov 12 '18 at 15:06
add a comment |
Is this input for some program?
– Marichyasana
Nov 12 '18 at 9:58
@Marichyasana I didn't get your question. This is not an input for a program it's just an LL(1) grammar with production rules. And I have to construct a parsing table for it, which in turn checks whether the input is syntactically correct or wrong.
– Rohit Mundada
Nov 12 '18 at 12:58
1
E'' can only be at the end of the sentence, so if you are using an augmented grammar its FOLLOW set is$(or whatever you use for the end token).
– rici
Nov 12 '18 at 15:06
Is this input for some program?
– Marichyasana
Nov 12 '18 at 9:58
Is this input for some program?
– Marichyasana
Nov 12 '18 at 9:58
@Marichyasana I didn't get your question. This is not an input for a program it's just an LL(1) grammar with production rules. And I have to construct a parsing table for it, which in turn checks whether the input is syntactically correct or wrong.
– Rohit Mundada
Nov 12 '18 at 12:58
@Marichyasana I didn't get your question. This is not an input for a program it's just an LL(1) grammar with production rules. And I have to construct a parsing table for it, which in turn checks whether the input is syntactically correct or wrong.
– Rohit Mundada
Nov 12 '18 at 12:58
1
1
E'' can only be at the end of the sentence, so if you are using an augmented grammar its FOLLOW set is
$ (or whatever you use for the end token).– rici
Nov 12 '18 at 15:06
E'' can only be at the end of the sentence, so if you are using an augmented grammar its FOLLOW set is
$ (or whatever you use for the end token).– rici
Nov 12 '18 at 15:06
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function ()
StackExchange.using("externalEditor", function ()
StackExchange.using("snippets", function ()
StackExchange.snippets.init();
);
);
, "code-snippets");
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "1"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
draft saved
draft discarded
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%2f53259624%2fconstructing-a-predictive-parser-table-for-this-grammar-e-ee-ee-num%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
draft saved
draft discarded
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.
draft saved
draft discarded
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%2f53259624%2fconstructing-a-predictive-parser-table-for-this-grammar-e-ee-ee-num%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
Is this input for some program?
– Marichyasana
Nov 12 '18 at 9:58
@Marichyasana I didn't get your question. This is not an input for a program it's just an LL(1) grammar with production rules. And I have to construct a parsing table for it, which in turn checks whether the input is syntactically correct or wrong.
– Rohit Mundada
Nov 12 '18 at 12:58
1
E'' can only be at the end of the sentence, so if you are using an augmented grammar its FOLLOW set is
$(or whatever you use for the end token).– rici
Nov 12 '18 at 15:06