• HOME
  • QUIZ
  • CONTACT US
EXAMIANS
  • COMPUTER
  • CURRENT AFFAIRS
  • ENGINEERING
    • Chemical Engineering
    • Civil Engineering
    • Computer Engineering
    • Electrical Engineering
    • Mechanical Engineering
  • ENGLISH GRAMMAR
  • GK
  • GUJARATI MCQ

Language Processors

Language Processors
Which table is a permanent databases that has an entry for each terminal symbol?

Literal table
Identifier table
Reductions
Terminal table

ANSWER DOWNLOAD EXAMIANS APP

Language Processors
In what module, multiple instances of execution will yield the same result even if one instancy has not terminated before the next one has begun?

serially reusable
non-reusable module
reenterable module
recursive module

ANSWER DOWNLOAD EXAMIANS APP

Language Processors
In which way(s) can a macro processor for assembly language be implemented?

All of these
processor incorporated into pass of a standard two-pass assembler
independent one-pass processor
independent two-pass processor

ANSWER DOWNLOAD EXAMIANS APP

Language Processors
Multiprogramming was made possible by

operating systems
both (a) and (b)
input/output units that operate independently of the CPU
neither (a) nor (b)

ANSWER DOWNLOAD EXAMIANS APP

Language Processors
The macro processor must perform

All of these
save the macro definitions
recognize macro definitions and macro calls
expand macro calls and substitute arguments

ANSWER DOWNLOAD EXAMIANS APP

Language Processors
Convert the 080D4E machine language instructions into assembly language, assuming that they were not generated by pseudo-ops:

ADDA h#01FE, i
LOADA h#OD4E, i
ASRA
STOREA h#014B, d

ANSWER DOWNLOAD EXAMIANS APP
MORE MCQ ON Language Processors

DOWNLOAD APP

  • APPLE
    from app store
  • ANDROID
    from play store

SEARCH

LOGIN HERE


  • GOOGLE

FIND US

  • 1.70K
    FOLLOW US
  • EXAMIANSSTUDY FOR YOUR DREAMS.
  • SUPPORT :SUPPORT EMAIL ACCOUNT : examians@yahoo.com

OTHER WEBSITES

  • GUJARATI MCQ
  • ACCOUNTIANS

QUICK LINKS

  • HOME
  • QUIZ
  • PRIVACY POLICY
  • DISCLAIMER
  • TERMS & CONDITIONS
  • CONTACT US
↑