The translator which performs macro calls expansion is called :
| A. | Macro processor |
| B. | Micro pre-processor |
| C. | Macro pre-processor |
| D. | Dynamic linker |
|
Option: C Explanation : Click on Discuss to view users comments. D.Krishnakumar said: (9:34pm on Monday 29th June 2015)
Option(C) is correct.refer standard OS
|
| A. | context free grammar |
| B. | context sensitive grammar |
| C. | unrestricted grammar |
| D. | phrase grammar |
|
Option: A Explanation : Click on Discuss to view users comments. jitendra said: (4:04pm on Monday 29th June 2015)
option [A]--LHS must be exactly 1 Non-terminal , RHS can be any String of terminals and Non--Terminals.
D.Krishnakumar said: (9:40pm on Monday 29th June 2015)
Option (A) is correct.In formal language theory, a context-free grammar (CFG) is a formal grammar in which every production rule is of the formV → wwhere V is a single nonterminal symbol, and w is a string of terminals and/or nonterminals (w can be empty).
D.Krishnakumar said: (9:41pm on Monday 29th June 2015)
Option(A) is correct.In formal language theory, a context-free grammar (CFG) is a formal grammar in which every production rule is of the formV → wwhere V is a single nonterminal symbol, and w is a string of terminals and/or nonterminals (w can be empty).
|
Which one from the following is false ?
| A. | LALR parser is Bottom - Up parser |
| B. |
A parsing algorithm which performs a left to right scanning and a right most deviation is RL (1).
|
| C. | LR parser is Bottom - Up parser. |
| D. | In LL(1), the 1 indicates that there is a one - symbol look - ahead. |
|
Option: B Explanation : Click on Discuss to view users comments. D.Krishnakumar said: (9:51pm on Monday 29th June 2015)
Option(B) is correct.Reason:1.LR and LALr parser are Bottom-Up parser2. In LL(1), 1->indicates one-symbol look ahead.Therefore (B) is false.
MOHD SHALIYAR said: (11:42pm on Friday 4th September 2015)
YES OPTION B IS THE ONLY ANSWER
|
Which phase of compiler generates stream of atoms ?
| A. | Syntax analysis |
| B. | Lexical Analysis |
| C. | Code generation |
| D. | Code optimization |
|
Option: A Explanation : Click on Discuss to view users comments. R.ARULMATHI said: (12:27am on Monday 6th July 2015)
CORRECT ANSWER IS A. STEM OF ATOMS MEANS COLLECTION OF SYNTAX TREES . SO THE ANSWER IS SYNTAX ANALYSIS
|
A disk drive has 100 ryclinders, numbered 0 to 99. Disk requests come to the disk driver for cyclinders 12,26,24,4,42,8 and 50 in that order. The driver is currently serving a request at cyclinder 24- A seek takes 6 msec per cyclinder moved. How much seek time is needed for shortest seek time first (SSTF) algorithm ?
| A. | 0.984 sec |
| B. | 0.396 sec |
| C. | 0.738 sec |
| D. | 0.42 sec |
|
Option: D Explanation : Click on Discuss to view users comments. |
