Problem D: Oinkway Pig Latin is a language constructed by transforming English words. The following rules are used to translate English into Pig Latin: If the word begins with a consonant, then all consonants at the beginning of the word, up to the first vowel are removed then added to the end of the word, followed by "ay". For example, "computer becomes "omputercay" and "think" becomes "inkthay". If the word begins with a vowel, then "way" is added to the end of the word. For example, "algorithm" becomes "algorithmway" and "office" becomes "officeway". If the word ends in a punctuation mark, then the punctuation mark should remain at the end of the word after the transformation has been performed. For example, "science!" should become "iencescay!". You can assume that the punctuation mark is only a single character. Create a program that reads a line of text from the user, translates it into Pig Latin and then displays the result. Hint: Making a set of vowels and consonants of the alphabet will prove useful. I IN 1: aight, imma head out, Charlie! [ OUT ]: aightway, [OUT ]: [ OUT ]: [ OUT]: outway, [ OUT ]: arliechby immaway eadhay

Problem D: Oinkway Pig Latin is a language constructed by transforming English words. The following rules are used to translate English into Pig Latin: If the word begins with a consonant, then all consonants at the beginning of the word, up to the first vowel are removed then added to the end of the word, followed by "ay". For example, "computer becomes "omputercay" and "think" becomes "inkthay". If the word begins with a vowel, then "way" is added to the end of the word. For example, "algorithm" becomes "algorithmway" and "office" becomes "officeway". If the word ends in a punctuation mark, then the punctuation mark should remain at the end of the word after the transformation has been performed. For example, "science!" should become "iencescay!". You can assume that the punctuation mark is only a single character. Create a program that reads a line of text from the user, translates it into Pig Latin and then displays the result. Hint: Making a set of vowels and consonants of the alphabet will prove useful. I IN 1: aight, imma head out, Charlie! [ OUT ]: aightway, [OUT ]: [ OUT ]: [ OUT]: outway, [ OUT ]: arliechby immaway eadhay

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Do the following code in any language you are comfortable
Debug C language main() { char ch = 'r'; boo isVowel = false; if(ch=='a'ch=='A'ch=='e'ch=='E'ch=='i'ch=='I' ch=='o'ch=='O'ch=='u'ch=='U') { isVowel = true; if (isVowel == true) printf("%d is a Consonant", ch); else printf("%d is a Vowel", ch); }
Please solve this problem using any programming language you are in good please solve it.
Java uses a right barace to mark the end of all compound statement what are arguments can you make against that statement
L={a*b™a" | n,m=1,2,3....} is given. i) Write a CFG for the language L.
C++ language please
Q1. a) The Little Man Computer (LMC) is an instructional model of a computer used to teach students all of the basic features of a modern computer in a simplified way. The following Little Man program is supposed to add two input numbers and output the result, i.e., OUT = IN1 + IN2 Mailbox Mnemonic code Numeric code 00 IN 901 01 STO 99 399 02 IN 901 03 ADD 99 199 04 OUT 902 05 COB 000 i) Change the program above to add the numbers 157 and 13. (Hint: these numbers are constants and therefore can pre-exist into memory before the execution of the program). No need to write both mnemonics and numeric codes (opcodes), either one is fine. Please refer to the instruction set provided for all the LMC instruction mnemonics and opcodes.
8. Build a DPDA that accepts the language L = {(ab)" (aab)b²" |n20
Debug C language int func(int) main() { int num = 7, c; int f= func(num); printf("\n\n%d of %d\n\n", num, f); } int func(aj); { if(aj=1 aj=0) return 1; else return (aj*fun(aj-1); }
ARDUINO LANGUAGE We have two push buttons and three LEDs (Red, Green and Blue). When the user presses button 1, the red LED will turn on and the blue LED will turnoff. If the user presses button 1 again the red LED will turn off and the blue LED willturn on. When the user presses button 2, the green LED will blink on and off 3 times. Considera delay of 1 second between blinks.Note: while the green LED is blinking, button 1 may not respond to presses. This is normaland acceptable for your code.
Assignment 16: Iteration Control Structure - Hands on practice Hint: Consider numbers 1 to 10, for each number find the odd multiples. Example, for 1, it should be 1, 3, 5, 7, 9 Objective: Given a real world problem, implement the logic and solve the problem using appropriate constructs (sequen- tial, selection, iteration) using an object oriented program- ming language (Java) for 2, it should be 2, 6, 10, 14, 18 Estimated time: 50 minutes Summary of this assignment: In this assignment, you have learnt the implementation of iteration control structures. Problem Description: Write simple java programs to implement the following prob- lems. 1.Find the sum of first 5 numbers (1 to 5) using for loop End of document statement 2.Find the product of first 5 numbers (1 to 5) using while loop statement 3. Generate the multiplication table of 10 upto multiple value 500 4.Calculate the square of first 5 numbers (1 to 5) using do..while statement 5.Find the odd multiples among the first 10…
Built regular expression of the following. 1. A language of any combination of even number of a's and even number of b’s containing abb as a substring. 2. Write an RE for the language L = {0^1m | where m + n is odd}. 3. All string does not contain the substring 'aaa' but has exactly one 'a'