Case Statement CD

SWITCH / CASE STATEMENT

1.    To capture the syntactic structure of the switch statement, we add the following production to the grammar. Here break is assumed to be a part of statement that is derivable form a non-terminal S.
2.       S                  switch E { Case list}
Case list      case list case V: S
Case list      case V: S
Case list      default: S
Case list      case list default: S
3.    A switch statement is comprised of two components an expression E.
4.    This is used to select a particular case from the list of cases and a caselist.
5.    This is a list of n number of cases each of which corresponds to one of the possible values of the expression E, perhaps including a default case.
6.    A syntax directed translation scheme that translated a case statement into a sequence of conditional jumps, each of which tests for an individual value and transfers to the code for the corresponding statement is considered below statement:
   Switch (E)
{
  Case V1: S1
  Case V2: S2
  Case VnSn
}
Figure shows all translation of statement

Fig: - A switch/case three-address translation.
7.    Therefore, switch statement translation involves generating an unconditional jump after the code of every S1,S2,….., Sn statements in order to transfer control to the next element of the switch statement, as well as to remember the code start of S1,S2,…,Sn and to generate the conditional jumps. Each  of these jumps tests for an individual value and transfer to the code for the corresponding statement. This requires introducing null able non terminals before S1, as shown in figure  

Python Programming ↓ 👆
Java Programming ↓ 👆
JAVA EasyExamNotes.com covered following topics in these notes.
JAVA Programs
Principles of Programming Languages ↓ 👆
Principles of Programming Languages
EasyExamNotes.com covered following topics in these notes.

Practicals:
Previous years solved papers:
A list of Video lectures References:
  1. Sebesta,”Concept of programming Language”, Pearson Edu 
  2. Louden, “Programming Languages: Principles & Practices” , Cengage Learning 
  3. Tucker, “Programming Languages: Principles and paradigms “, Tata McGraw –Hill. 
  4. E Horowitz, "Programming Languages", 2nd Edition, Addison Wesley

    Computer Organization and Architecture ↓ 👆

    Computer Organization and Architecture 

    EasyExamNotes.com covered following topics in these notes.

    1. Structure of desktop computers
    2. Logic gates
    3. Register organization
    4. Bus structure
    5. Addressing modes
    6. Register transfer language
    7. Direct mapping numericals
    8. Register in Assembly Language Programming
    9. Arrays in Assembly Language Programming

    References:

    1. William stalling ,“Computer Architecture and Organization” PHI
    2. Morris Mano , “Computer System Organization ”PHI

    Computer Network ↓ 👆
    Computer Network

    EasyExamNotes.com covered following topics in these notes.
    1. Data Link Layer
    2. Framing
    3. Byte count framing method
    4. Flag bytes with byte stuffing framing method
    5. Flag bits with bit stuffing framing method
    6. Physical layer coding violations framing method
    7. Error control in data link layer
    8. Stop and Wait scheme
    9. Sliding Window Protocol
    10. One bit sliding window protocol
    11. A protocol Using Go-Back-N
    12. Selective repeat protocol
    13. Application layer
    References:
    1. Andrew S. Tanenbaum, David J. Wetherall, “Computer Networks” Pearson Education.
    2. Douglas E Comer, “Internetworking with TCP/IP Principles, Protocols, And Architecture",Pearson Education
    3. KavehPahlavan, Prashant Krishnamurthy, “Networking Fundamentals”, Wiley Publication.
    4. Ying-Dar Lin, Ren-Hung Hwang, Fred Baker, “Computer Networks: An Open Source Approach”, McGraw Hill.