1 / 12

Introduction (continued ) lecture 3

Introduction (continued ) lecture 3. 2 . So the lexical analyzer converts symbols to an array of easy to use symbolic constants ( TOKENS ). 3 .Also, it removes spaces and other unnecessary things like comments etc. And main function: main () {a=1; b=3;

uri
Download Presentation

Introduction (continued ) lecture 3

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Introduction(continued ) lecture 3

  2. 2. So the lexical analyzer converts symbols to an array of easy to use symbolic constants (TOKENS). 3.Also, it removes spaces and other unnecessary things like comments etc.

  3. And main function: main () {a=1; b=3; Fmax(++a, ++b) // this calls the inline function with incremented //values of a and during compilation Whereas instead of this if we have a call like Mmax(++a, ++b) // this leads to two increments in value of b // as expression replaced is (++a>++b? ++a: ++b) This just takes the passed arguments and replaces them in the expression. Then compilation evaluates it. PRO-C: C+SQL Acts as a translator

More Related