Hi, I'm receiving "Segmentation fault" error in the code below. https://pastebin.com/pafMGawk Error most probably is in the last line of the main function, if I'm not wrong. Can anyone explain why it is happening and what can be done to correct it? Let me know if I'm messing up elsewhere. Thanks

Never heard of it, is it something like gdb?

Why is recursive parsing so complicated 😭😭😭

Hi, I'm receiving "Segmentation fault" error in the code below. https://pastebin.com/pafMGawk Error most probably is in the last line of the main function, if I'm not wrong. Can anyone explain why it is happening and what can be done to correct it? Let me know if I'm messing up elsewhere. Thanks

Hey, so I found this about C optimisation and UB: As long as you don't invoke undefined behaviour (eg. reading outside the bounds of a variable), you are fine. As an optimiser, the compiler is unlikely to care about which branch will happen and will do as good a job of picking the one with the better chance of success. Also, in some compilers (C99 or newer), it's possible to do some optimisations for certain types of branches. For example, the "switch" construct can be very optimised for certain types of branches. This is a compiler generated switch, not a manual switch statement. Edit: this behaviour was changed in C99. The optimiser must be able to prove that the outcome of a non-taken branch is the same as a taken branch, and if the former can't do so, the former must be removed from the program, no matter which branch is taken. Can someone explain that in easier words lol? Reading this just gets me confused 😂

in what context

It is not easy to explain this in simpler words. The standard has actually used as simple words as possible to describe a very complex optimization technique. Check out gcc optimization regarding RTL if-conversion. It is a heavy subject unless you have compiler development experience

Hey, so I found this about C optimisation and UB: As long as you don't invoke undefined behaviour (eg. reading outside the bounds of a variable), you are fine. As an optimiser, the compiler is unlikely to care about which branch will happen and will do as good a job of picking the one with the better chance of success. Also, in some compilers (C99 or newer), it's possible to do some optimisations for certain types of branches. For example, the "switch" construct can be very optimised for certain types of branches. This is a compiler generated switch, not a manual switch statement. Edit: this behaviour was changed in C99. The optimiser must be able to prove that the outcome of a non-taken branch is the same as a taken branch, and if the former can't do so, the former must be removed from the program, no matter which branch is taken. Can someone explain that in easier words lol? Reading this just gets me confused 😂

Can't you figure it out from the code itself? You are initializing l1 and l2 as null pointers and then accessing them as if they are valid pointers in the very next line. There could be other issues as well.

Assuming there is a Node class having val and *next as its members. If I write below code in main function, Node* N1 = new Node(); N1->val = 1; N1->next = new Node(); N1->val = 2; What happens to val if I do this? Not getting errors but results are not correct either(as expected😅).

Oh nice, Is this possible then? N1->next->val = 2; N1->next->next->val = 3; N1->next->next->next->val = 4; And so on...

Oh nice, Is this possible then? N1->next->val = 2; N1->next->next->val = 3; N1->next->next->next->val = 4; And so on...

Assuming there is a Node class having val and *next as its members. If I write below code in main function, Node* N1 = new Node(); N1->val = 1; N1->next = new Node(); N1->val = 2; What happens to val if I do this? Not getting errors but results are not correct either(as expected😅).

int a(0) and int a = 0 are same or different

int a(0) and int a = 0 are same or different

Any one help me with division

https://gist.github.com/168c4b17dd814fd977a2db88af5d9f5f i dont know how to correctly do this 🙁

#include<stdio.h> int addition(int a,int b); int subtraction(int a,int b); int product(int a ,int b); float division (int a,int b); int main() { int x ,y; int calculation; printf("Entre for x and y:"); scanf("%d%d",&x,&y); printf("Entre: 1.for addition;2.for subtraction;3.for product;4.for devision:%d ");; scanf("%d",&calculation); switch(calculation) { case 1: addition(x,y); printf("The calculation is :%d",addition(x,y)); break; case 2: subtraction(x,y); printf("The calculation is :%d",subtraction(x,y)); break; case 3: product(x,y); printf("The calculation is :%d",product(x,y)); break; case 4:division(x,y); printf("The calculation is :%d",division(x,y)); break; default:printf("Only limited option available"); } return 0; } //O1 int product(int a ,int b) { int multiple; multiple=a*b; return multiple; } //O2 float division (int a,int b) { int div; div=a/b; return div; } //O3 int subtraction(int a,int b) { int sub; sub=a-b; return sub; } //O3 int addition(int a,int b) { int sum; sum=a+b; return sum; }

in the case of https://gist.github.com/mgood7123/006f114fce1d47a6b3d76b21ae7a5579 (i got a basic proof-of-concept for this recursive-parsing working so at least it IS possible

also you don't need to create a separate variable int product(int a, int b) { return a*b; } float division(int a, int b) { return a/b; } int subtraction(int a, int b) { return a-b; } int subtraction(int a, int b) { return a+b; }

also you don't need to create a separate variable int product(int a, int b) { return a*b; } float division(int a, int b) { return a/b; } int subtraction(int a, int b) { return a-b; } int subtraction(int a, int b) { return a+b; }

If I divide 1/2 it is still 0

1/2 is 0.5, casted to an integer it returns 0

why does a division of two ints get casted to a float🧐

the operator / when provided two int arguments returns an integer

i always thought it returned a double/float even when two ints are passed, thanks

what about for

Wait let me create repository