• 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
Reductions
Identifier table
Terminal table

ANSWER DOWNLOAD EXAMIANS APP

Language Processors
Convert the .WORD d#790 assemblylanguage pseudo-ops into hexadecimal machine language:

42 65 61 72
03 16
F8
0111EF

ANSWER DOWNLOAD EXAMIANS APP

Language Processors
The task(s) of the Lexial analysis phase is/are:

to build a uniform symbol table
All of these
to build a literal table and an identifier table
to parse the source program into the basic elements or tokens of the language

ANSWER DOWNLOAD EXAMIANS APP

Language Processors
Convert the CHARI h#000F, s assembly language instructions into hexadecimal machine language:

40
DA000F
0111EF
9000000000

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?

non-reusable module
serially reusable
reenterable module
recursive module

ANSWER DOWNLOAD EXAMIANS APP

Language Processors
Systems software is a program that directs the overall operation of the computer, facilitates its use and interacts with the users. What are the different types of this software?

Operating system
Languages
All of these
Utilities

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
↑