Wednesday, March 23, 2016

What is Lexema?

 Lexema : A lexema is a sequence of characters in the source program that is matched by the pattern for a token.

Example : For Pascal statement - 
Cons pi = 3.1416;
Here, the sub-string pi is a lexema for the token "identifier."

If You want to learn about the technology, computer science & engineering, web programming, freelancing, earning please click here :CSE SOLVE

Related Posts:

  • What is Intermediate Language with two properties? Intermediate Language with two properties : - After syntax & semantic analysis the compiler generates an explicit intermediate representation of the source program. This, intermediate representation as a program for an … Read More
  • What is Postfix notation/Reverse Polish notation With Example? Postfix notation/Reverse Polish notation : It is the form of an expression obtained from postorder traversal of the tree representing this expression. So, in the postfix notation, operators must be placed after the ope… Read More
  • What is infix notation with example? Infix notation : It is the form of an expression obtained from in order traversal of the tree representing this expression. So in the infix notation, Operators must be placed in the operands. Example :  A+B, C*D, /GH… Read More
  • What is Activation Code? Activation Code : Stack allocation collect fixed -storage by using activation record. The activation record contain the following steps -  Storage for simple name & pointers to array & other data structures l… Read More
  • What is Prefix notation/Polish notation With Example? Prefix notation/Polish notation : It is the form of an expression obtained from preorder traversal of the tree representing this expression. So, in the prefix notation, operators must be placed before the operands.  … Read More

0 comments:

Post a Comment