Solve those: ( please don't copy from online): source code: Download the Java source code of a lexical analyzer (Main.Java). A summary of the source codeis provided below.1. The lexical analyzer program identifiesa) alphanumeric lexemes (variables) as IDENT token,b) numeric token (constant integers) as INT_LIT token, andc) all other lexemes, such as ('+','','1', (), are identified as "UNKNOWN"category. The program uses a look-up table to retrieve the token value for thesesymbols. Any symbols other than these will throw an error.2.The program reads characters of a line of code from an external text file, identifies andprints the lexemes and token numbers.3. You must type one-page report highlighting your work and any additional features youmay have added (for bonus points). Upload this report on DROPBOX. NO HANDWRITTENitems will be accepted.4. Write a line of code in a text file as follows and provide the screenshot of lexicalanalyzer output in your report. You need to write no more than one-page report. (15)your_last_name] = ([last two digits of your T-number]+[your first name]) -yourFavoriteCity85yourFavoriteState]Example: smith = (65+ohn) - norfolk85ny5. Modify the code in such a way that if it gets a character that is not in the lookup table, itprints an error message "Invalid lexeme, character not found." Test this scenario placingan example character in the text file such as '$' or '%' or '#'. Provide screenshots of yourmodified part of the code and the output. Hint: please add a case for the '=' sign.(5)6. For bonus points, investigate ways to add new features to your program as follows. Youmay obtain up to 100% additional points as bonus. Provide screenshots of the modifiedpart of the code along with the output.a. What if someone declares a variable starting with numerals (e.g., 8varX). Throwan error message suggesting that this is an illegal variable declaration.Can you detect a semicolon as the end of line (EOF)?b.c. Can you detect reserved lexemes and their tokens such as IF, WHILE, FOR, INT?

Lexical Analyzer is the primary section of the compiler additionally referred to as a scanner. It…

Download the Java source code of a lexical analyzer (Main.Java). A summary of the source code is provided below. 1. The lexical analyzer program identifies a) alphanumeric lexemes (variables) as IDENT token, b) numeric token (constant integers) as INT_LIT token, and c) all other lexemes, such as ('+', , , , , (), are identified as "UNKNOWN" category. The program uses a look-up table to retrieve the token value for these symbols. Any symbols other than these will throw an error

Download the Java source code of a lexical analyzer (Main.Java). A summary of the source code is provided below. 1. The lexical analyzer program identifies a) alphanumeric lexemes (variables) as IDENT token, b) numeric token (constant integers) as INT_LIT token, and c) all other lexemes, such as ('+', , , , , (), are identified as "UNKNOWN" category. The program uses a look-up table to retrieve the token value for these symbols. Any symbols other than these will throw an error

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

Please make a method to convert from binary to decimal and vice versa A “Procedural CLI Calculator” that you will develop using only the procedural constructs of the Java language. You are not allowed to use any object-oriented programming constructs of Java in your implementation except the following: o the Main class, since every Java program needs to be presented as a class, o Scanner class with all its methods for input and output, o Array and String classes with all their methods since most procedural languages provide them among their fundamental constructs
IN HASKELL PROGRAMMING LANGUAGE PLEASE In case you do not know it: the game is played on a 3x3 grid that is initially empty. Two players are playing, by alternatingly making moves. A move by a player places their token (an X for player 1, an O for player 2) into a cell that was empty. We are using algebraic notations for indexing the positions in the board, with A,B,C indexing the columns and 1,2,3 the rows. Specifically, these coordinates would be used in the implementation for moves made by a human player. If the X X O Figure 1: Sample board position same token appears 3 times in any of the three columns, three rows or two main diagonals the game is over and that player wins. If the grid is filled without that happening the game is a draw. For the depicted board, we have Xs in positions C3 and A2, and an O in position B1. It would be O’s turn to make a move; a legal move would be C2, but it is not a good move, because X can force a win by responding A1. O cannot force a win, but…
solve the problem in java:Consider the are n=2 subjects and needed =[4,5]answered questions, to pass.The student has answered =[2,4] questions in the two subjects so far, and can answer another q=1 questions across all subjects combined. The best outcome is to answer an additional question in the second subject on order to pass it, as 2 more answers required to pass the first subject. the max number of subject s that can be passed is 1. the function must return an integer that can represent the max number of subjects that can be passed. public static int maxNumsub(List <Integer> answered, List<Integer> needed, int q){//write code here}
Please answer in Python In this assignment, you will do an implementation of the Huffman Code. If you have the Data Structures book for this class, on pages 415-421 is the theory for encoding a String using the Huffman Code. There is also a PDF of these pages on the class website. Your task is to develop a proof of concept of the Huffman Code and demonstrate it by taking a String and encoding it. The Huffman Code requires knowledge of a few data structure concepts discussed in class: Priority Queues Binary Trees Recursion Arrays and/or Linked Lists In your program, you will demonstrate an understanding of all these concepts by developing your own priority queue, node, binary tree, array, and/or linked list, and use of recursion to support the Huffman Code encryption algorithm. Read through the theory of the Huffman Code in the text and then write a program that can take a String and encrypt it. For example, given a String “Hello World”, the program should apply the Huffman Code…
Java problem implement this specification. In addition, while Scanner input and System.out output will take place only in the main method, all solitaire game simulation and computation of the first player win probability estimate should take place in a method getAdvantage that takes an integer parameter for the number of games to simulate, and returns a double-precision floating-point first player win probability. The main method will read the desired number of simulations, call method getAdvantage with that number, and report the returned number in the specified format. Specification: First-Player Advantage Pig is a folk jeopardy dice game with simple rules: Two players race to reach 100 points. Each turn, a player repeatedly rolls a die until either a 1 ("pig") is rolled or the player holds and scores the sum of the rolls (i.e. the turn total). At any time during a player's turn, the player is faced with two decisions: roll - If the player rolls a 1: the player scores nothing…
Write a program in C++ using arrays, C-trings, classes, and libraries. Write a program to handle a user's rolodex entries. (A rolodex is a system with tagged cards each representing a contact. It would contain a name, address, and phone number. In this day and age, it would probably have an email address as well.) Typical operations people want to do to a rolodex entry are: 1) Add entry 2) Edit entry 3) Delete entry 4) Find entry 5) Print all entries 6) Quit You can decide what the maximum number of rolodex entries is and how long each part of an entry is (name, address, etc.). When they choose to edit an entry, give them the option of selecting from the current rolodex entries or returning to the main menu — don't force them to edit someone just because they chose that option. Similarly for deleting an entry. Also don't forget that when deleting an entry, you must move all following entries down to fill in the gap. If they want to add an entry and the rolodex is full, offer them the…
The word "cat" can be spelled from the period table element symbols by using the sequence of elements carbon and astatine in that order. Since the symbol for carbon is "C" and the symbol for astatine is "At", which together makes [C][At]; thus, "cat" is an elemental phrase. To determine which elements can be used all combinations of 1 and 2 letter element symbols must be tested. Write a java program to determine if a lowercase word can be made with any combination of 1 or 2 letter element symbols from the periodic table. The list elements will come from a text file containing all the atomic elements and their symbols. The user will enter a lowercase word to check for from the keyboard. Assume the word is properly spelled but check for all lowercase letters. Output to the screen the list of chemical elements if it can be made from the element symbols following the format as seen below, if not output: "No element phrase possible." Output all possible solutions if applicable. Finally, ask…
in java We want to present the animal world. In the Java programming language, implement the following entities (specify whether the interface or class) for Animal (has the properties name and age), the Reptile (has all Animal properties and the property of the length and method print) and Bird (has all Animal properties and a property flight and a method of print). - Correctly establish relations between entities. - Also show the use of these entities (Birds and Reptiles).
Please implement in Java implement a keyed bag in which the items to be stored are strings (perhaps people’s names) and the keys are numbers (perhaps Social Security or other identification numbers). So, the in- sertion method has this specification: public void insert(String entry, int key);// Precondition: size( ) < CAPACITY, and the // bag does not yet contain any item// with the given key.// Postcondition: A new copy of entry has// been added to the bag, with the given key. When the programmer wants to remove or retrieve an item from a keyed bag, the key of the item must be specified rather than the item itself. The keyed bag should also have a boolean method that can be used to determine whether the bag has an item with a specified key. In a keyed bag, the pro- grammer using the class specifies a particular key when an item is inserted. Here’s an implementation idea: A keyed bag can have two private arrays, one that holds the string data and one that holds the corresponding…
Write a program in C++ that reads HAND_SIZE cards from the user, then analyzes the cards and prints out the type of poker hand that they represent. (HAND_SIZE will be a global constant, typically 5, but your program must still work if it is set to something other than 5.) Poker hands are categorized according to the following hand-types: Straight flush, four of a kind, full house, straight, flush, three of a kind, two pairs, pair, high card. To simplify the program we will ignore card suits, and face cards. The values that the user inputs will be integer values from LOWEST_NUM to HIGHEST_NUM. (These will be global constants. We'll use LOWEST_NUM = 2 and HIGHEST_NUM = 9, but your program must work if these are set to something different.) When your program runs it should start by collecting HAND_SIZE integer values from the user and placing the integers into an array that has HAND_SIZE elements. It might look like this: Enter 5 numeric cards, no face cards. Use 2 - 9. Card 1: 8 Card 2:…
Write Java code and a C++ Code for the problem given below as: Given an array of distinct integers. The task is to count all the triplets such that sum of two elements equals the third element.
In Java: The program extends the representation for rational numbers Add a test class TestSimplifiedRational Define the simplified rationals r1..r4 and initialize them with 1/2, -3/9, 10/12 and 1 Compute sum=r1+r2 and diff=r4-r3 Simplify both results Check if they are equal, using equals and comparing their numerators and denominators. What do you observe? Compare r1 with r2, r3 and r4. Print all the rational numbers and partial results.