Context-Free grammar - Normal form
$begingroup$
Termials = a,b,c.
non-Termials = A,S.
Production Rules:
(1) S → aS
(2) S → bA
(3) A → bA
(4) A → cA
(5) A → c
(6) S → a
How do you write the following in normal form, I understand that it is currently not a context free grammar language of normal form , so I want to modify to be.
discrete-mathematics formal-languages regular-language context-free-grammar conjunctive-normal-form
$endgroup$
add a comment |
$begingroup$
Termials = a,b,c.
non-Termials = A,S.
Production Rules:
(1) S → aS
(2) S → bA
(3) A → bA
(4) A → cA
(5) A → c
(6) S → a
How do you write the following in normal form, I understand that it is currently not a context free grammar language of normal form , so I want to modify to be.
discrete-mathematics formal-languages regular-language context-free-grammar conjunctive-normal-form
$endgroup$
$begingroup$
How do you convert different values for one non - terminal of production rules to CNF?
$endgroup$
– Sue
Jan 23 at 10:51
$begingroup$
By CNF in your comment you mean Chomsky Normal Form? In the question you do not specifiy. There are also Greibach Normal Form and other normal forms for CFG. For CNF you can easily find conversion algorithms.
$endgroup$
– Peter Leupold
Jan 23 at 12:00
$begingroup$
@Sue A good start is to actually understand the grammar you're given. Can you describe what the words it creates are?
$endgroup$
– Nick Peterson
Jan 23 at 18:52
add a comment |
$begingroup$
Termials = a,b,c.
non-Termials = A,S.
Production Rules:
(1) S → aS
(2) S → bA
(3) A → bA
(4) A → cA
(5) A → c
(6) S → a
How do you write the following in normal form, I understand that it is currently not a context free grammar language of normal form , so I want to modify to be.
discrete-mathematics formal-languages regular-language context-free-grammar conjunctive-normal-form
$endgroup$
Termials = a,b,c.
non-Termials = A,S.
Production Rules:
(1) S → aS
(2) S → bA
(3) A → bA
(4) A → cA
(5) A → c
(6) S → a
How do you write the following in normal form, I understand that it is currently not a context free grammar language of normal form , so I want to modify to be.
discrete-mathematics formal-languages regular-language context-free-grammar conjunctive-normal-form
discrete-mathematics formal-languages regular-language context-free-grammar conjunctive-normal-form
edited Jan 23 at 10:55
Sue
asked Jan 23 at 10:41
SueSue
126
126
$begingroup$
How do you convert different values for one non - terminal of production rules to CNF?
$endgroup$
– Sue
Jan 23 at 10:51
$begingroup$
By CNF in your comment you mean Chomsky Normal Form? In the question you do not specifiy. There are also Greibach Normal Form and other normal forms for CFG. For CNF you can easily find conversion algorithms.
$endgroup$
– Peter Leupold
Jan 23 at 12:00
$begingroup$
@Sue A good start is to actually understand the grammar you're given. Can you describe what the words it creates are?
$endgroup$
– Nick Peterson
Jan 23 at 18:52
add a comment |
$begingroup$
How do you convert different values for one non - terminal of production rules to CNF?
$endgroup$
– Sue
Jan 23 at 10:51
$begingroup$
By CNF in your comment you mean Chomsky Normal Form? In the question you do not specifiy. There are also Greibach Normal Form and other normal forms for CFG. For CNF you can easily find conversion algorithms.
$endgroup$
– Peter Leupold
Jan 23 at 12:00
$begingroup$
@Sue A good start is to actually understand the grammar you're given. Can you describe what the words it creates are?
$endgroup$
– Nick Peterson
Jan 23 at 18:52
$begingroup$
How do you convert different values for one non - terminal of production rules to CNF?
$endgroup$
– Sue
Jan 23 at 10:51
$begingroup$
How do you convert different values for one non - terminal of production rules to CNF?
$endgroup$
– Sue
Jan 23 at 10:51
$begingroup$
By CNF in your comment you mean Chomsky Normal Form? In the question you do not specifiy. There are also Greibach Normal Form and other normal forms for CFG. For CNF you can easily find conversion algorithms.
$endgroup$
– Peter Leupold
Jan 23 at 12:00
$begingroup$
By CNF in your comment you mean Chomsky Normal Form? In the question you do not specifiy. There are also Greibach Normal Form and other normal forms for CFG. For CNF you can easily find conversion algorithms.
$endgroup$
– Peter Leupold
Jan 23 at 12:00
$begingroup$
@Sue A good start is to actually understand the grammar you're given. Can you describe what the words it creates are?
$endgroup$
– Nick Peterson
Jan 23 at 18:52
$begingroup$
@Sue A good start is to actually understand the grammar you're given. Can you describe what the words it creates are?
$endgroup$
– Nick Peterson
Jan 23 at 18:52
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
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
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
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%2fmath.stackexchange.com%2fquestions%2f3084316%2fcontext-free-grammar-normal-form%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
Thanks for contributing an answer to Mathematics Stack Exchange!
- 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.
Use MathJax to format equations. MathJax reference.
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%2fmath.stackexchange.com%2fquestions%2f3084316%2fcontext-free-grammar-normal-form%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
$begingroup$
How do you convert different values for one non - terminal of production rules to CNF?
$endgroup$
– Sue
Jan 23 at 10:51
$begingroup$
By CNF in your comment you mean Chomsky Normal Form? In the question you do not specifiy. There are also Greibach Normal Form and other normal forms for CFG. For CNF you can easily find conversion algorithms.
$endgroup$
– Peter Leupold
Jan 23 at 12:00
$begingroup$
@Sue A good start is to actually understand the grammar you're given. Can you describe what the words it creates are?
$endgroup$
– Nick Peterson
Jan 23 at 18:52