Define keyword and identifiers, Computer Engineering

Assignment Help:

Q. Define Keyword and Identifiers?

Keyword:  A keyword is a statement which defines nature of that statement. If statement is a directive then keyword would be the title of that directive whereas if the statement is data-allocation statement then keyword would be a data definition type.

Some illustrations of keywords are: SEGMENT (directive), MOV (statement) etc. 

Identifiers:  An identifier is a name which you apply to an item in your program which you expect to reference.  The 2 kinds of identifiers are label and name.

1.    Name denotes to address of a data item like counter, arr etc.

2.    Label denotes to address of our instruction or process or segment. For illustration

MAIN is the label for a process as below:

  MAIN PROC FAR

                         A20:   BL,45 ; defines a label A20.

Identifier may employ alphabet, digit or special character but it always starts with an alphabet.


Related Discussions:- Define keyword and identifiers

What is indexed addressing, What is Indexed addressing The location of ...

What is Indexed addressing The location of data is calculated as sum of an address specified by one of previous methods, and value of an index register. This allows an array of

Mutation - canonical genetic algorithm, Mutation: However it may appea...

Mutation: However it may appear that the above recombinations are a little arbitrary that especially as points defining whether crossover and inversion occur are chosen random

Truth tables, Any function can be expressed in a truth table.A truth table ...

Any function can be expressed in a truth table.A truth table lists all possible combinations ofinputs and gives the output produced in eachcase.Truth tables must include all combin

Explain different system calls for performing different task, Write down di...

Write down different system calls for performing different kinds of tasks. The major types of system calls are given as: Process Control: These kinds of system calls are

Explain non-pre-emptive algorithms, Explain non-pre-emptive algorithms?   ...

Explain non-pre-emptive algorithms?   Non preemptive algorithms: In this algorithm a job is provided to CPU for execution as long as the job is non-completed the CPU cannot

Software, its language base assignment

its language base assignment

What do you mean by decoders, Q. What do you mean by Decoders? Decoder ...

Q. What do you mean by Decoders? Decoder transforms one kind of coded information to other form. A decoder has n inputs and one enable line (sort of selection line) and 2 n ou

How reassembling of ip fragments is advantageous, Reassembling of IP fragme...

Reassembling of IP fragments at the ultimate destination is advantageous. Give reasons. Needing the ultimate destination to reassemble the fragments has two major advantages. F

Telematics, How are switching system classified

How are switching system classified

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd