Modified automated censor program Program plan: Define the “illegal()” function, Open the input file name in read mode. Create empty list. Create “for” loop to iterate over all the lines. Assign the value with the removed white spaces. Create “for” loop to iterate over list, Print the list element. Check whether the word is equal to list element. If it is “True”, return “True”. Define the “main()” function, Open the input file name in read mode. Open the output file name in write mode. Create “for” loop to iterate over all the lines in a file, Split the words using “split()” method. Create “for” loop to iterate over all the characters in a word, Check whether the value return from function “illegal()” is “True”, If it is “True”, replace the word with “****”. Join all the words. Print all the lines in output file. Call the “main()” function.

Question

Want to see the full answer?

Answer 1

Question

Chapter 11, Problem 12PE

Program Plan Intro

Modified automated censor program

Program plan:

Define the “illegal()” function,

Open the input file name in read mode.

Create empty list.

Create “for” loop to iterate over all the lines.

Assign the value with the removed white spaces.

Create “for” loop to iterate over list,

Print the list element.

Check whether the word is equal to list element.

If it is “True”, return “True”.

Define the “main()” function,

Open the input file name in read mode.

Open the output file name in write mode.

Create “for” loop to iterate over all the lines in a file,

Split the words using “split()” method.

Create “for” loop to iterate over all the characters in a word,

Check whether the value return from function “illegal()” is “True”,

If it is “True”, replace the word with “****”.

Join all the words.

Print all the lines in output file.

Call the “main()” function.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Send me the lexer and parser

Here is my code please draw a transition diagram and nfa on paper public class Lexer { private static final char EOF = 0; private static final int BUFFER_SIZE = 10; private Parser yyparser; // parent parser object private java.io.Reader reader; // input stream public int lineno; // line number public int column; // column // Double buffering implementation private char[] buffer1; private char[] buffer2; private boolean usingBuffer1; private int currentPos; private int bufferLength; private boolean endReached; // Keywords private static final String[] keywords = { "int", "print", "if", "else", "while", "void" }; public Lexer(java.io.Reader reader, Parser yyparser) throws Exception { this.reader = reader; this.yyparser = yyparser; this.lineno = 1; this.column = 0; // Initialize double buffering buffer1 = new char[BUFFER_SIZE]; buffer2 = new char[BUFFER_SIZE]; usingBuffer1 = true; currentPos = 0; bufferLength = 0; endReached = false; // Initial buffer fill fillBuffer(); } private…

If integer x is divisible by 3, can you prove that ceil(x/2) + floor(x/6) = floor(x/2) + ceil(x/6)