Trouble with my scheme function that tries to create production values with a given grammar
So I am trying to create a function where given the following input '((a (xz) (c)) (b (wy) (d)))
I am supposed to do something like this'((a (xz)) (a (c)) (b (wy)) (b (d)))
I tried to write this
(define productionValues
(lambda (input)
(let ((lhs (map (lambda (x) (car x)) input)))
(let ((rhs (map (lambda (y) (cdr y)) input)))
(map (lambda (l) (cons l (map (lambda (r) (car r)) rhs))) lhs)
)
)
))
This does not work and gets me ((a (xz) (c)) (b (xz) (c)))
My logic behind this is I have a variable lhs that stores (a b)
and rhs that stores (((xz) (c)) ((wy) (d)))
and I would try to use another set of map functions to grab from the between the two variables, but I feel like I'm on somewhat the right track but just don't understand how i could get my desired output.
scheme racket
add a comment |
So I am trying to create a function where given the following input '((a (xz) (c)) (b (wy) (d)))
I am supposed to do something like this'((a (xz)) (a (c)) (b (wy)) (b (d)))
I tried to write this
(define productionValues
(lambda (input)
(let ((lhs (map (lambda (x) (car x)) input)))
(let ((rhs (map (lambda (y) (cdr y)) input)))
(map (lambda (l) (cons l (map (lambda (r) (car r)) rhs))) lhs)
)
)
))
This does not work and gets me ((a (xz) (c)) (b (xz) (c)))
My logic behind this is I have a variable lhs that stores (a b)
and rhs that stores (((xz) (c)) ((wy) (d)))
and I would try to use another set of map functions to grab from the between the two variables, but I feel like I'm on somewhat the right track but just don't understand how i could get my desired output.
scheme racket
add a comment |
So I am trying to create a function where given the following input '((a (xz) (c)) (b (wy) (d)))
I am supposed to do something like this'((a (xz)) (a (c)) (b (wy)) (b (d)))
I tried to write this
(define productionValues
(lambda (input)
(let ((lhs (map (lambda (x) (car x)) input)))
(let ((rhs (map (lambda (y) (cdr y)) input)))
(map (lambda (l) (cons l (map (lambda (r) (car r)) rhs))) lhs)
)
)
))
This does not work and gets me ((a (xz) (c)) (b (xz) (c)))
My logic behind this is I have a variable lhs that stores (a b)
and rhs that stores (((xz) (c)) ((wy) (d)))
and I would try to use another set of map functions to grab from the between the two variables, but I feel like I'm on somewhat the right track but just don't understand how i could get my desired output.
scheme racket
So I am trying to create a function where given the following input '((a (xz) (c)) (b (wy) (d)))
I am supposed to do something like this'((a (xz)) (a (c)) (b (wy)) (b (d)))
I tried to write this
(define productionValues
(lambda (input)
(let ((lhs (map (lambda (x) (car x)) input)))
(let ((rhs (map (lambda (y) (cdr y)) input)))
(map (lambda (l) (cons l (map (lambda (r) (car r)) rhs))) lhs)
)
)
))
This does not work and gets me ((a (xz) (c)) (b (xz) (c)))
My logic behind this is I have a variable lhs that stores (a b)
and rhs that stores (((xz) (c)) ((wy) (d)))
and I would try to use another set of map functions to grab from the between the two variables, but I feel like I'm on somewhat the right track but just don't understand how i could get my desired output.
scheme racket
scheme racket
edited Nov 21 at 4:47
asked Nov 21 at 4:40
onbu
358
358
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
I'm not entirely sure what you're trying to accomplish there - but this produced the desired output:
(define (productionValues input)
; flatten the sublists
(apply append
; create the lists as per the sample
(map (lambda (x) (list (list (first x) (second x))
(list (first x) (third x))))
input)))
For example:
(define input '((a (xz) (c)) (b (wy) (d))))
(productionValues input)
=> '((a (xz)) (a (c)) (b (wy)) (b (d)))
The overall goal of this project is to build an LL(1) parser and this is one of my functions that takes functions with the same non terminal and merge them onto one line. For example [a ::= (xz) | (c) ] b ::= (wy) | (d) ] is converted to this in scheme '((a (xz) (c)) (b (wy) (d))), and i have to take each left hand symbol and apply it to the appropriate rule. Hope this makes sense.
– onbu
Nov 21 at 16:50
@onbu ok, thanks for the context :) anyway, that doesn't change my answer, it's giving the correct output for your sample input. Unless you have a counter-example, I think we can mark is as correct now ;)
– Óscar López
Nov 21 at 16:57
yea thanks, took me a while to apply your logic into what i wanted.
– onbu
Nov 21 at 21:14
add a comment |
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
});
}
});
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%2f53405361%2ftrouble-with-my-scheme-function-that-tries-to-create-production-values-with-a-gi%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
I'm not entirely sure what you're trying to accomplish there - but this produced the desired output:
(define (productionValues input)
; flatten the sublists
(apply append
; create the lists as per the sample
(map (lambda (x) (list (list (first x) (second x))
(list (first x) (third x))))
input)))
For example:
(define input '((a (xz) (c)) (b (wy) (d))))
(productionValues input)
=> '((a (xz)) (a (c)) (b (wy)) (b (d)))
The overall goal of this project is to build an LL(1) parser and this is one of my functions that takes functions with the same non terminal and merge them onto one line. For example [a ::= (xz) | (c) ] b ::= (wy) | (d) ] is converted to this in scheme '((a (xz) (c)) (b (wy) (d))), and i have to take each left hand symbol and apply it to the appropriate rule. Hope this makes sense.
– onbu
Nov 21 at 16:50
@onbu ok, thanks for the context :) anyway, that doesn't change my answer, it's giving the correct output for your sample input. Unless you have a counter-example, I think we can mark is as correct now ;)
– Óscar López
Nov 21 at 16:57
yea thanks, took me a while to apply your logic into what i wanted.
– onbu
Nov 21 at 21:14
add a comment |
I'm not entirely sure what you're trying to accomplish there - but this produced the desired output:
(define (productionValues input)
; flatten the sublists
(apply append
; create the lists as per the sample
(map (lambda (x) (list (list (first x) (second x))
(list (first x) (third x))))
input)))
For example:
(define input '((a (xz) (c)) (b (wy) (d))))
(productionValues input)
=> '((a (xz)) (a (c)) (b (wy)) (b (d)))
The overall goal of this project is to build an LL(1) parser and this is one of my functions that takes functions with the same non terminal and merge them onto one line. For example [a ::= (xz) | (c) ] b ::= (wy) | (d) ] is converted to this in scheme '((a (xz) (c)) (b (wy) (d))), and i have to take each left hand symbol and apply it to the appropriate rule. Hope this makes sense.
– onbu
Nov 21 at 16:50
@onbu ok, thanks for the context :) anyway, that doesn't change my answer, it's giving the correct output for your sample input. Unless you have a counter-example, I think we can mark is as correct now ;)
– Óscar López
Nov 21 at 16:57
yea thanks, took me a while to apply your logic into what i wanted.
– onbu
Nov 21 at 21:14
add a comment |
I'm not entirely sure what you're trying to accomplish there - but this produced the desired output:
(define (productionValues input)
; flatten the sublists
(apply append
; create the lists as per the sample
(map (lambda (x) (list (list (first x) (second x))
(list (first x) (third x))))
input)))
For example:
(define input '((a (xz) (c)) (b (wy) (d))))
(productionValues input)
=> '((a (xz)) (a (c)) (b (wy)) (b (d)))
I'm not entirely sure what you're trying to accomplish there - but this produced the desired output:
(define (productionValues input)
; flatten the sublists
(apply append
; create the lists as per the sample
(map (lambda (x) (list (list (first x) (second x))
(list (first x) (third x))))
input)))
For example:
(define input '((a (xz) (c)) (b (wy) (d))))
(productionValues input)
=> '((a (xz)) (a (c)) (b (wy)) (b (d)))
answered Nov 21 at 9:13
Óscar López
175k22225320
175k22225320
The overall goal of this project is to build an LL(1) parser and this is one of my functions that takes functions with the same non terminal and merge them onto one line. For example [a ::= (xz) | (c) ] b ::= (wy) | (d) ] is converted to this in scheme '((a (xz) (c)) (b (wy) (d))), and i have to take each left hand symbol and apply it to the appropriate rule. Hope this makes sense.
– onbu
Nov 21 at 16:50
@onbu ok, thanks for the context :) anyway, that doesn't change my answer, it's giving the correct output for your sample input. Unless you have a counter-example, I think we can mark is as correct now ;)
– Óscar López
Nov 21 at 16:57
yea thanks, took me a while to apply your logic into what i wanted.
– onbu
Nov 21 at 21:14
add a comment |
The overall goal of this project is to build an LL(1) parser and this is one of my functions that takes functions with the same non terminal and merge them onto one line. For example [a ::= (xz) | (c) ] b ::= (wy) | (d) ] is converted to this in scheme '((a (xz) (c)) (b (wy) (d))), and i have to take each left hand symbol and apply it to the appropriate rule. Hope this makes sense.
– onbu
Nov 21 at 16:50
@onbu ok, thanks for the context :) anyway, that doesn't change my answer, it's giving the correct output for your sample input. Unless you have a counter-example, I think we can mark is as correct now ;)
– Óscar López
Nov 21 at 16:57
yea thanks, took me a while to apply your logic into what i wanted.
– onbu
Nov 21 at 21:14
The overall goal of this project is to build an LL(1) parser and this is one of my functions that takes functions with the same non terminal and merge them onto one line. For example [a ::= (xz) | (c) ] b ::= (wy) | (d) ] is converted to this in scheme '((a (xz) (c)) (b (wy) (d))), and i have to take each left hand symbol and apply it to the appropriate rule. Hope this makes sense.
– onbu
Nov 21 at 16:50
The overall goal of this project is to build an LL(1) parser and this is one of my functions that takes functions with the same non terminal and merge them onto one line. For example [a ::= (xz) | (c) ] b ::= (wy) | (d) ] is converted to this in scheme '((a (xz) (c)) (b (wy) (d))), and i have to take each left hand symbol and apply it to the appropriate rule. Hope this makes sense.
– onbu
Nov 21 at 16:50
@onbu ok, thanks for the context :) anyway, that doesn't change my answer, it's giving the correct output for your sample input. Unless you have a counter-example, I think we can mark is as correct now ;)
– Óscar López
Nov 21 at 16:57
@onbu ok, thanks for the context :) anyway, that doesn't change my answer, it's giving the correct output for your sample input. Unless you have a counter-example, I think we can mark is as correct now ;)
– Óscar López
Nov 21 at 16:57
yea thanks, took me a while to apply your logic into what i wanted.
– onbu
Nov 21 at 21:14
yea thanks, took me a while to apply your logic into what i wanted.
– onbu
Nov 21 at 21:14
add a comment |
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%2f53405361%2ftrouble-with-my-scheme-function-that-tries-to-create-production-values-with-a-gi%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