{"id":214,"date":"2018-07-20T06:46:07","date_gmt":"2018-07-20T06:46:07","guid":{"rendered":"http:\/\/csp10.epgpbooks.inflibnet.ac.in\/?post_type=chapter&p=214"},"modified":"2018-07-20T06:54:21","modified_gmt":"2018-07-20T06:54:21","slug":"control-flow-statements-and-boolean-expressions","status":"publish","type":"chapter","link":"https:\/\/ebooks.inflibnet.ac.in\/csp10\/chapter\/control-flow-statements-and-boolean-expressions\/","title":{"rendered":"Control Flow statements and Boolean Expressions"},"content":{"raw":"

In this module we learn to generate three address code for control flow statements. We will also try to incorporate short circuit information in Boolean expression\u2019s 3-address code generation. As the flow in control flow\u2019s statements involve Boolean expressions, we will look at the semantic rules for generating three-address code involving Boolean expressions with Control flow.<\/p>\r\n \r\n\r\n25.1 Control Flow statements<\/strong>\r\n\r\n \r\n

We have seen semantic rules that would help generate three-address code for declarations, array accesses, arithmetic expressions, Boolean expressions and to keep track of scope information. Thus, a context free grammar is used to define every programming construct and we write semantic rules based on this context free grammar to generate three-address code.<\/p>\r\n \r\n

Control flow statements are essential components of programming languages that allows executing code based on a decision. The typically available contro l flow statements are if-then, if- then-else, while-do statement and do \u2013 while statements. The control flow statements have an expression that needs to be evaluated and based on the true or false value of the expression the appropriate branching is taken. The context free grammar for defining control flow statements can be defined as<\/p>\r\n \r\n\r\nS \u00e0 if E then S1 | if E then S1 else S2 | while E do S1 | do S1 while E\r\n\r\n \r\n

The LHS symbol \u2018S\u2019 stands for statement. The production defines a statement could be a simple \u201cif Expression then Statement\u201d or \u201cif Expression then statement else alternate statement\u201d, \u201cwhile Expression is true do the statements repeatedly\u201d or do a statement repeatedly while the expression is true. In all these statements \u201cE\u201d corresponds to a Boolean expression or sometimes it could be an assignment statement. Thus to generate three-address code for a control flow statement, the first step is to generate code for the expression. This expression could be a sequence of expressions combined with relational and logical operators. Let us discuss each type of control flow statements and the semantic rules used for generating three-address code in the subsequent sections.<\/p>\r\n \r\n\r\n25.1.1 Three-address code for if-then statements<\/strong>\r\n\r\n \r\n\r\nThe schematic for generating three-address code for if- then statements is given in figure 25.1. As discussed already the expression E needs to be executed first and hence the code corresponding to E is generated first. The value of the expression is evaluated and if it is found to be \u201ctrue\u201d the statement corresponding to the body of the if- then is executed followed by the statement following the if-then statement. If the expression is false, the body of the if- then is skipped and directly we go to the statement that is following the if-then statement\u2019s body.\r\n\r\n \r\n\r\n\"\"\r\n\r\n\"\"\r\n\r\n\"\"\r\n\r\n\"\"\r\n

The sections 25.1.1 to 25.1.4 discussed the various semantic rules for, if- then, if-then-else, while, do-while loops. A \u2018for\u2019 loop construct may be considered as a \u2018while\u2019 construct and this can be used to generate 3-address code<\/p>\r\n \r\n\r\n25.2 Control flow with Boolean expression<\/strong>\r\n\r\n \r\n

In the previous module we discussed about how to generate three-address code for Boolean expressions. We had generated two new variable and one was set to value \u20180\u2019 if the expression is false and other set to \u20181\u2019 if the expression is true. However, we could avoid generating code for the Boolean expression based on the logical operators if they are connected by one. Avoiding generation of code for some expression in a Boolean expression is referred to as short circuit based code generation.<\/p>\r\n \r\n\r\nShort circuit avoids computing the full expression involving logical operators. Consider the example where the expression is given by \u201ca > b\u201d . The corresponding code for this expression would be\r\n\r\n \r\n\r\n100 If a > b goto E.true\r\n\r\n \r\n\r\n101 goto E.false\r\n\r\n \r\n

This is different from creating a temporary variable and assigning it 0 \/ 1. In other words if an expression E is given as E1 or E2 where \u2018or\u2019 is a logical operator, then if E1 is true, then this can directly be associated to E.true and we could skip generating code for E2. However, if E1 is false then E2 need to be evaluated. The table 25.5 summarizes the various semantic rules associated by incorporating this short circuit information to generate three-address code.<\/p>\r\n \r\n\r\n\"\"\r\n\r\n\"\"\r\n\r\n\"\"\r\n\r\n\"\"\r\n\r\n ","rendered":"

In this module we learn to generate three address code for control flow statements. We will also try to incorporate short circuit information in Boolean expression\u2019s 3-address code generation. As the flow in control flow\u2019s statements involve Boolean expressions, we will look at the semantic rules for generating three-address code involving Boolean expressions with Control flow.<\/p>\n

 <\/p>\n

25.1 Control Flow statements<\/strong><\/p>\n

 <\/p>\n

We have seen semantic rules that would help generate three-address code for declarations, array accesses, arithmetic expressions, Boolean expressions and to keep track of scope information. Thus, a context free grammar is used to define every programming construct and we write semantic rules based on this context free grammar to generate three-address code.<\/p>\n

 <\/p>\n

Control flow statements are essential components of programming languages that allows executing code based on a decision. The typically available contro l flow statements are if-then, if- then-else, while-do statement and do \u2013 while statements. The control flow statements have an expression that needs to be evaluated and based on the true or false value of the expression the appropriate branching is taken. The context free grammar for defining control flow statements can be defined as<\/p>\n

 <\/p>\n

S \u00e0 if E then S1 | if E then S1 else S2 | while E do S1 | do S1 while E<\/p>\n

 <\/p>\n

The LHS symbol \u2018S\u2019 stands for statement. The production defines a statement could be a simple \u201cif Expression then Statement\u201d or \u201cif Expression then statement else alternate statement\u201d, \u201cwhile Expression is true do the statements repeatedly\u201d or do a statement repeatedly while the expression is true. In all these statements \u201cE\u201d corresponds to a Boolean expression or sometimes it could be an assignment statement. Thus to generate three-address code for a control flow statement, the first step is to generate code for the expression. This expression could be a sequence of expressions combined with relational and logical operators. Let us discuss each type of control flow statements and the semantic rules used for generating three-address code in the subsequent sections.<\/p>\n

 <\/p>\n

25.1.1 Three-address code for if-then statements<\/strong><\/p>\n

 <\/p>\n

The schematic for generating three-address code for if- then statements is given in figure 25.1. As discussed already the expression E needs to be executed first and hence the code corresponding to E is generated first. The value of the expression is evaluated and if it is found to be \u201ctrue\u201d the statement corresponding to the body of the if- then is executed followed by the statement following the if-then statement. If the expression is false, the body of the if- then is skipped and directly we go to the statement that is following the if-then statement\u2019s body.<\/p>\n

 <\/p>\n

\"\"<\/p>\n

\"\"<\/p>\n

\"\"<\/p>\n

\"\"<\/p>\n

The sections 25.1.1 to 25.1.4 discussed the various semantic rules for, if- then, if-then-else, while, do-while loops. A \u2018for\u2019 loop construct may be considered as a \u2018while\u2019 construct and this can be used to generate 3-address code<\/p>\n

 <\/p>\n

25.2 Control flow with Boolean expression<\/strong><\/p>\n

 <\/p>\n

In the previous module we discussed about how to generate three-address code for Boolean expressions. We had generated two new variable and one was set to value \u20180\u2019 if the expression is false and other set to \u20181\u2019 if the expression is true. However, we could avoid generating code for the Boolean expression based on the logical operators if they are connected by one. Avoiding generation of code for some expression in a Boolean expression is referred to as short circuit based code generation.<\/p>\n

 <\/p>\n

Short circuit avoids computing the full expression involving logical operators. Consider the example where the expression is given by \u201ca > b\u201d . The corresponding code for this expression would be<\/p>\n

 <\/p>\n

100 If a > b goto E.true<\/p>\n

 <\/p>\n

101 goto E.false<\/p>\n

 <\/p>\n

This is different from creating a temporary variable and assigning it 0 \/ 1. In other words if an expression E is given as E1 or E2 where \u2018or\u2019 is a logical operator, then if E1 is true, then this can directly be associated to E.true and we could skip generating code for E2. However, if E1 is false then E2 need to be evaluated. The table 25.5 summarizes the various semantic rules associated by incorporating this short circuit information to generate three-address code.<\/p>\n

 <\/p>\n

\"\"<\/p>\n

\"\"<\/p>\n

\"\"<\/p>\n

\"\"<\/p>\n

 <\/p>\n","protected":false},"author":4,"menu_order":25,"template":"","meta":{"pb_show_title":"on","pb_short_title":"","pb_subtitle":"","pb_authors":["dr-rajeswari-sridhar"],"pb_section_license":""},"chapter-type":[],"contributor":[59],"license":[],"class_list":["post-214","chapter","type-chapter","status-publish","hentry","contributor-dr-rajeswari-sridhar"],"part":3,"_links":{"self":[{"href":"https:\/\/ebooks.inflibnet.ac.in\/csp10\/wp-json\/pressbooks\/v2\/chapters\/214","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/ebooks.inflibnet.ac.in\/csp10\/wp-json\/pressbooks\/v2\/chapters"}],"about":[{"href":"https:\/\/ebooks.inflibnet.ac.in\/csp10\/wp-json\/wp\/v2\/types\/chapter"}],"author":[{"embeddable":true,"href":"https:\/\/ebooks.inflibnet.ac.in\/csp10\/wp-json\/wp\/v2\/users\/4"}],"version-history":[{"count":3,"href":"https:\/\/ebooks.inflibnet.ac.in\/csp10\/wp-json\/pressbooks\/v2\/chapters\/214\/revisions"}],"predecessor-version":[{"id":225,"href":"https:\/\/ebooks.inflibnet.ac.in\/csp10\/wp-json\/pressbooks\/v2\/chapters\/214\/revisions\/225"}],"part":[{"href":"https:\/\/ebooks.inflibnet.ac.in\/csp10\/wp-json\/pressbooks\/v2\/parts\/3"}],"metadata":[{"href":"https:\/\/ebooks.inflibnet.ac.in\/csp10\/wp-json\/pressbooks\/v2\/chapters\/214\/metadata\/"}],"wp:attachment":[{"href":"https:\/\/ebooks.inflibnet.ac.in\/csp10\/wp-json\/wp\/v2\/media?parent=214"}],"wp:term":[{"taxonomy":"chapter-type","embeddable":true,"href":"https:\/\/ebooks.inflibnet.ac.in\/csp10\/wp-json\/pressbooks\/v2\/chapter-type?post=214"},{"taxonomy":"contributor","embeddable":true,"href":"https:\/\/ebooks.inflibnet.ac.in\/csp10\/wp-json\/wp\/v2\/contributor?post=214"},{"taxonomy":"license","embeddable":true,"href":"https:\/\/ebooks.inflibnet.ac.in\/csp10\/wp-json\/wp\/v2\/license?post=214"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}