Assertion (A): A load-and-go assembler avoids the overhead of writing the object program out and reading it back in. Reason (R): This can be done with either a one-pass or a two-pass assembler.
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: C. (A) is true but (R) is false
Explanation
A load-and-go assembler places code directly in memory, avoiding writing the object program out and reading it back (A true). It can be one-pass or two-pass (R true), but that does not explain A.
Note on the official key: the official key says option A. Official/PW key is A. Beck notes a load-and-go assembler can be one-pass or two-pass, so R is true, but it does not explain why A holds; option B fits.
More Theory of Computation and Compilers questions
- Which of the following languages are not regular? A. L = {(01)ⁿ0ᵏ | n > k, k ≥ 0} B. L = {cⁿbᵏaⁿ⁺ᵏ | n ≥ 0, k ≥ 0} C. L = {0ⁿ1ᵏ | n ≠ k}
- Any string of terminals generated by the CFG S → XY, X → 0X | 1X | 0, Y → Y0 | Y1 | 0 (S is the start symbol)
- Let L1 = {0ⁿ1ⁿ0ᵐ | n ≥ 1, m ≥ 1}, L2 = {0ⁿ1ᵐ0ᵐ | n ≥ 1, m ≥ 1}, L3 = {0ⁿ1ⁿ0ⁿ | n ≥ 1}. Which are correct? A. L3 = L1 ∩ L2. B. L1 and L2 are…
- Given below are two statements Statement I: The family of context free languages is closed under homomorphism Statement II: The family of c…
- What is the minimum number of states required to the finite automaton equivalent to the transition diagram given below?
- Find the regular expression for the language accepted by the automata given below.