Answer to Question #15898 in C++ for davood farajzade
Write the c++ program to filter out any tag that looks like one of these:// //Now Word is a single word that immediately follows the left angle bracket, but may be followed by more text which may include spaces. A tag ends with a right angle bracket, which might or might not be proceeded by a space. Assume that a tag starts and ends on the same line. With this definition, the following are tags // // //[i] //[/i]// // //Start by setting a flag to false. Now look at the input stream of tokens one by one. When a token starts a tag set a Boolean flag to true. While the flag is true discard tokens until encountering a tag end (either stuff> or >). Set the flag to false.[table][/table]
No comments. Be first!