what are the compilation steps?
( i want inside the compiler )
Answers were Sorted based on User's Feedback
Answer / sai
Before the compilation of any C program Saved as a .C
extention. In C compiler architecture there is a
preprocesser algoritham i.e is used to preprocess the
header files. After including the header files there is a
compiler algorithm that generates .asm file to .c file.
The .obj file is generated from .asm by using assembler
algorithm. the .obj files are 2 types.
1. .boj file for library functions
2. .obj file for user defined functions
There is a linker algorithm to combine and generate .exe
file for .obj files. After .exe file the program executed
sucessfully.
| Is This Answer Correct ? | 6 Yes | 0 No |
Answer / vignesh1988i
first step::: it will include the watever header file
with .h extension
second::: then it will read each line by line ...
third:::: then it will convert the code to the machine
level code
fourth>::: it will then match the syntax with the compailer
syntax which is being writtern there
fifth::: but logical errors in the program cant be found by
the compailer
sixth::: as soon as the syntax is said to be correct this
will be again decoded by the compailer to the user....this
will say SUCCESS... if syntax dosent match wit that syntax
in compailer it will give an ERROR
| Is This Answer Correct ? | 15 Yes | 13 No |
a memory of 20 bytes is allocated to a string declared as char *s then the following two statements are executed: s="Etrance" l=strlen(s); what is the value of l ? a.20 b.8 c.9 d.21
Write a C program to get the desired output. 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 . . . 1 n..............n 1 Note: n is a positive integer entered by the user.
how many key words availabel in c a) 28 b) 31 c) 32
How can I swap two values without using a temporary?
where do we use volatile keyword?
main() { int a; a=++100; printf("%d",a); getch(); }
Why is a semicolon (;) put at the end of every program statement?
There is a 100-story building and you are given two eggs. The eggs (and the building) have an interesting property that if you throw the egg from a floor number less than X, it will not break. And it will always brake if the floor number is equal or greater than X. Assuming that you can reuse the eggs which didn't broke; you got to find X in a minimal number of throws. Give an algorithm to find X in minimal number of throws.
Is there a built-in function in C that can be used for sorting data?
What is the o/p of the follow pgm? #include<stdio.h> main() { char char_arr[5]=”ORACL”; char c=’E’; prinf(“%s\n”,strcat(char_arr,c)); } a:oracle b. oracl c.e d.none
How can I open files mentioned on the command line, and parse option flags?
Explain a pre-processor and its advantages.