20DCE096_dlp_prac3.pdf
•
0 likes•2 views
This document describes implementing a lexical analyzer to identify numbers in a given text file. It defines a token type for literals, includes necessary header files, and declares functions to classify and print tokens. The main function opens the input file, reads it line by line, and uses isdigit() to check each character for numbers, copying potential number strings to a lexeme array. It passes identified number strings to the printToken function which outputs the token type and lexeme. The program successfully implements a basic lexical analyzer to only recognize numeric literals.
Report
Share
Report
Share
Download to read offline
![20DCE096 CE442: DESIGN OF LANGUAGE PROCESSOR 8
PRACTICAL - 3
Aim: Implement a l a lexical analyzer for the identification of numbers.
Code:
#include <stdio.h>
#include <string.h>
#include <ctype.h>
// Define token types
enum TokenType {
LITERAL,
};
// Function to classify and print tokens
void printToken(char* lexeme, enum TokenType type) {
char* tokenTypeStr;
switch (type) {
case LITERAL:
tokenTypeStr = "Literal";
break;
default:
tokenTypeStr = "Unknown";
}
printf("Type: %s, Lexeme: %sn", tokenTypeStr, lexeme);
}
int main() {
FILE *file = fopen("input.txt", "r"); // Open the file in read mode
if (file == NULL) {
perror("Error opening file");
return 1;
}
char input[1000];
char lexeme[1000];
int i = 0;
int j = 0;
while (fgets(input, sizeof(input), file) != NULL) {
for (i = 0; i < strlen(input); i++) {
// Check for numeric literals
if (isdigit(input[i])) {
j = 0;
while (isdigit(input[i]) || input[i] == '.') {](https://image.slidesharecdn.com/20dce096dlpprac3-231010130814-116eb6f5/85/20DCE096_dlp_prac3-pdf-1-320.jpg)
![20DCE096 CE442: DESIGN OF LANGUAGE PROCESSOR 9
lexeme[j++] = input[i++];
}
lexeme[j] = '0';
printToken(lexeme, LITERAL);
i--;
}
}
}
fclose(file); // Close the file
return 0;
}
Output:
Conclusion: In this practical we implement lexical analyser which identify only number from the
given file content.
Grade:
Signature:
Remarks:](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
Recommended
IN C++ languageWrite a simple word processor that will accept text.pdf
IN C++ language
Write a simple word processor that will accept text and commands as input. The commands it
should respond to are:
Substitute/oldstring/newstring/
Copy #
Locate/string/
Delete #
Move #
Type #
Pastes Insert #
Replace #
Quit
The program should be able to open an existing file or create a new one. It should keep track of
where the user is in the file at any time. Each command is followed by a number which indicates
the number of line (the current line & those following) upon which the command should act.
Each command should operate on the specified line or lines of the file.
Solution
#include
#include
#include
#include
using namespace std;
const bool DEBUG = false;
const int MAX = 100;
struct file // This contains the file information and contents
{
string contents[MAX];
string fileName;
int currentLineIndex;
int total;
bool markupHighlighting;
};
int NumberInputReader(string); // Reads the numbers from user input
void Help(); // Prints out a help menu
void Markup(file&, int); // Does HTML highlighting
void MarkupApply(file&, string, int); // Applies the HTML highlighting to the file
//void Substitute(file&, string); // substitutes portions of lines of text
//void Type(file&, int); // prints text to the screen
//void Copy(file, string[], int&); // copies text
//void Paste(file&, string[], int, int); // pastes text
//void Locate(file &, string); // finds text
//void Insert(file &, int); // inputs text to the array
//void Delete(file &, int); // deletes text
//void Replace(file &, int); // replaces while lines of text text
//void Move(file &, int); // moves the current line
//void Quit(file); // quits the program, asks the users if they want to save.
void Open(file &); // allows the user to open a file
void New(file &); // allows the user to create a file
void Save(file); // saves the array to a file.
void IndexPrint(file); // for debugging, this prints the contents of the array.
int main() // Main program
{
file txtFile;
txtFile.currentLineIndex=-1;
txtFile.total=0;
int inputValue=0, copyNumber;
string inputString, openYN, copyQue[MAX];
char inputChar, openYNtemp;
// ANIMATION LOOP GOES HERE
cout<<\"~~~\\033[1;32m Welcome \\033[0m~~~\ \"; // first use of colors in the program
cout<<\"Would you like to open an existing file? \"
<\'
Markup(txtFile, inputValue);
break;
case \'>\': // Unhighlight
txtFile.markupHighlighting=false; // if false, it\'ll go through the motions
Markup(txtFile, inputValue); // again, but revert to the original array
break; // afterward.
case \'*\': // * saves file to disk
Save(txtFile);
break;
case \'?\':
Help(); // \"I seem to be having difficulty with my lifestyle.\" -Arthur Dent
break;
case\'.\': // default for re-looping
break;
default:
cout<<\"\\033[1;31m\'\"< total: \"< currentLineIndex: \"<=80) // If it takes up the
entire default width of
{ // the window.
cout<<\"\\033[1;31m-That\'s a very long command, \"
<<\"I\'m just but a humble Line Editor.-\\033[0m \"<=8)
{
inputColor=0; // Default color
cout<<\.
Java Programming Below are the lexer token and shank file.pdf
Java Programming: Below are the lexer, token, and shank files with the shank.txt. Fix any error in
the files but make sure the shank.txt is being printed out in the terminal of eclipse. Show the full
code for all three files along with the screenshot of shank.txt being read in the terminal. Attached is
the rubric.
Lexer.java
package mypack;
import java.util.ArrayList;
import java.util.List;
import mypack.Token.TokenType;
import java .util.HashMap;
public class Lexer {
private static final int INTEGER_STATE = 1;
private static final int DECIMAL_STATE = 2;
private static final int IDENTIFIER_STATE = 3;
private static final int ERROR_STATE = 4;
private static final int SYMBOL_STATE = 5;
private static final int STRING_STATE = 6;
private static final int CHAR_STATE = 7;
private static final int COMMENT_STATE = 8;
private static final char EOF = (char) -1;
private static String input;
private static int index;
private static char currentChar;
private static int lineNumber = 1;
private static int indentLevel = 0;
private static int lastIndentLevel = 0;
private static HashMap<String, TokenType> keywords = new HashMap<String, TokenType>() {{
put("while", TokenType.WHILE);
put("if", TokenType.IF);
put("else", TokenType.ELSE);
put("print", TokenType.PRINT);
}};
private static HashMap<Character, TokenType> symbols = new HashMap<Character,
TokenType>() {{
put('+', TokenType.PLUS);
put('-', TokenType.MINUS);
put('*', TokenType.MULTIPLY);
put('/', TokenType.DIVIDE);
put('=', TokenType.EQUALS);
put(':', TokenType.COLON);
put(';', TokenType.SEMICOLON);
put('(', TokenType.LEFT_PAREN);
put(')', TokenType.RIGHT_PAREN);
put('{', TokenType.LEFT_BRACE);
put('}', TokenType.RIGHT_BRACE);
put('<', TokenType.LESS_THAN);
put('>', TokenType.GREATER_THAN);
}};
public Lexer(String input) {
Lexer.input = input;
index = 0;
currentChar = input.charAt(index);
}
private void nextChar() {
index++;
if (index >= input.length()) {
currentChar = EOF;
} else {
currentChar = input.charAt(index);
}
}
private void skipWhiteSpace() {
while (Character.isWhitespace(currentChar)) {
nextChar();
}
}
private int getIndentLevel() {
int level = 0;
int i = index;
char c = input.charAt(i);
while (c == ' ' || c == 't') {
if (c == 't') {
level += 1;
} else if (c == ' ') {
level += 1;
}
i++;
if (i >= input.length()) {
break;
}
c = input.charAt(i);
}
return level;
}
public List<Token> lex(String inputString) throws Exception {
input = inputString;
index = 0;
currentChar = input.charAt(index);
List<Token> tokens = new ArrayList<Token>();
while (currentChar != EOF) {
switch (currentState()) {
case INTEGER_STATE:
integerState(tokens);
break;
case DECIMAL_STATE:
decimalState(tokens);
break;
case IDENTIFIER_STATE:
identifierState(tokens);
break;
case ERROR_STATE:
errorState(tokens);
break;
case SYMBOL_STATE:
symbolState(tokens);
break;
case STRING_STATE:
stringState(tokens);
break;
case CHAR_STATE:
charState(tokens);
break;
case COMMENT_STATE:
commentState(tokens);
break;
default:
break;
}
}
return tokens.
Java Programming Below are the lexer token and shank file.pdf
Java Programming: Below are the lexer, token, and shank files with the shank.txt. Shank.java is
the main method file. The main goal is to make sure the shank.txt is being printed out in the
terminal of eclipse. Make sure there are no errors in the code at all. Show the screenshot of
shank.txt being read in the terminal. Attached is the rubric.
Lexer.java
package mypack;
import java.util.ArrayList;
import java.util.List;
import mypack.Token.TokenType;
import java .util.HashMap;
public class Lexer {
private static final int INTEGER_STATE = 1;
private static final int DECIMAL_STATE = 2;
private static final int IDENTIFIER_STATE = 3;
private static final int ERROR_STATE = 4;
private static final int SYMBOL_STATE = 5;
private static final int STRING_STATE = 6;
private static final int CHAR_STATE = 7;
private static final int COMMENT_STATE = 8;
private static final char EOF = (char) -1;
private static String input;
private static int index;
private static char currentChar;
private static int lineNumber = 1;
private static int indentLevel = 0;
private static int lastIndentLevel = 0;
private static HashMap<String, TokenType> keywords = new HashMap<String, TokenType>() {{
put("while", TokenType.WHILE);
put("if", TokenType.IF);
put("else", TokenType.ELSE);
put("print", TokenType.PRINT);
}};
private static HashMap<Character, TokenType> symbols = new HashMap<Character,
TokenType>() {{
put('+', TokenType.PLUS);
put('-', TokenType.MINUS);
put('*', TokenType.MULTIPLY);
put('/', TokenType.DIVIDE);
put('=', TokenType.EQUALS);
put(':', TokenType.COLON);
put(';', TokenType.SEMICOLON);
put('(', TokenType.LEFT_PAREN);
put(')', TokenType.RIGHT_PAREN);
put('{', TokenType.LEFT_BRACE);
put('}', TokenType.RIGHT_BRACE);
put('<', TokenType.LESS_THAN);
put('>', TokenType.GREATER_THAN);
}};
public Lexer(String input) {
Lexer.input = input;
index = 0;
currentChar = input.charAt(index);
}
private void nextChar() {
index++;
if (index >= input.length()) {
currentChar = EOF;
} else {
currentChar = input.charAt(index);
}
}
private void skipWhiteSpace() {
while (Character.isWhitespace(currentChar)) {
nextChar();
}
}
private int getIndentLevel() {
int level = 0;
int i = index;
char c = input.charAt(i);
while (c == ' ' || c == 't') {
if (c == 't') {
level += 1;
} else if (c == ' ') {
level += 1;
}
i++;
if (i >= input.length()) {
break;
}
c = input.charAt(i);
}
return level;
}
public List<Token> lex(String inputString) throws Exception {
input = inputString;
index = 0;
currentChar = input.charAt(index);
List<Token> tokens = new ArrayList<Token>();
while (currentChar != EOF) {
switch (currentState()) {
case INTEGER_STATE:
integerState(tokens);
break;
case DECIMAL_STATE:
decimalState(tokens);
break;
case IDENTIFIER_STATE:
identifierState(tokens);
break;
case ERROR_STATE:
errorState(tokens);
break;
case SYMBOL_STATE:
symbolState(tokens);
break;
case STRING_STATE:
stringState(tokens);
break;
case CHAR_STATE:
charState(tokens);
break;
case COMMENT_STATE:
commentState(tokens);
break;
def.
Lab01Filesbuild.bat@echo offclsset DRIVE_LETTER=1.docx
Lab01Files/build.bat
@echo off
cls
set DRIVE_LETTER=%1:
set PATH=%DRIVE_LETTER%\MinGW\bin;%DRIVE_LETTER%\MinGW\msys\1.0\bin;c:\Windows;c:\Windows\system32
g++ -c Keyboard.cpp
g++ -c Random.cpp
g++ -c String.cpp
g++ -c ReadFile.cpp
g++ -c WriteFile.cpp
g++ -c PlayerGuessDriver.cpp
g++ -o PlayerGuess.exe PlayerGuessDriver.o ReadFile.o WriteFile.o String.o Keyboard.o Random.o
Lab01Files/Keyboard.cpp
#include "Keyboard.h"
#include <iostream>
int readInt(string prompt)
{
cout << prompt;
int val = 0;
cin >> val;
return val;
}
int getValidatedInt(string prompt, int min, int max)
{
int validated = readInt(prompt);
cout << validated << endl;
while(validated < min || validated > max)
{
validated = readInt(prompt);
cout << validated << endl;
}
return validated;
}
double readDouble(string prompt)
{
cout << prompt;
double val = 0;
cin >> val;
return val;
}
double getValidatedDouble(string prompt, double min, double max)
{
double validated = readDouble(prompt);
cout << validated << endl;
while(validated < min || validated > max)
{
validated = readDouble(prompt);
cout << validated << endl;
}
return validated;
}
String* readString(string prompt)
{
cout << prompt;
string text;
getline(cin, text);
String* str = createString(text.c_str());
return str;
}
Lab01Files/Keyboard.h
#if !defined KEYBOARD
#define KEYBOARD
#include "Text.h"
#include <string>
using namespace std;
//pre: the string (character literal) that will prompt the user for input
//post: the input read from the keyboard interpreted as an int is returned
int readInt(string prompt);
int getValidatedInt(string prompt, int min, int max);
//pre: the string that will prompt the user for input
//post: the input read from the keyboard interpreted as a double is returned
double readDouble(string prompt);
double getValidatedDouble(string prompt, double min, double max);
//pre: the string that will prompt the user for input
// the string to store the user input and the length of the input storage string
//post: the text read from the keyboard is copied into the storage string
String* readString(string prompt);
#endif
Lab01Files/Laboratory 01_ Guessing Game.pdf
8/28/2014 Laboratory 01: Guessing Game
http://mboshart.dyndns.org/boshart/2111Labs/Lab01.html 1/3
Laboratory 01: Guessing Game
Download the following files and place them in your working directory:
Starting code for this lab:
Lab01Files.zip //provided, completed files, refer to header files for method
signatures
PlayerGuessDriver.cpp //most of the work is in this file
range.txt //contains the two integers that define the range for the secret
number
build.bat //convenience file for compiling and linking
Guessing Game
In this lab, you will write a simple guessing game. The computer will generate a
random integer within a valid spe ...
Recommended
IN C++ languageWrite a simple word processor that will accept text.pdf
IN C++ language
Write a simple word processor that will accept text and commands as input. The commands it
should respond to are:
Substitute/oldstring/newstring/
Copy #
Locate/string/
Delete #
Move #
Type #
Pastes Insert #
Replace #
Quit
The program should be able to open an existing file or create a new one. It should keep track of
where the user is in the file at any time. Each command is followed by a number which indicates
the number of line (the current line & those following) upon which the command should act.
Each command should operate on the specified line or lines of the file.
Solution
#include
#include
#include
#include
using namespace std;
const bool DEBUG = false;
const int MAX = 100;
struct file // This contains the file information and contents
{
string contents[MAX];
string fileName;
int currentLineIndex;
int total;
bool markupHighlighting;
};
int NumberInputReader(string); // Reads the numbers from user input
void Help(); // Prints out a help menu
void Markup(file&, int); // Does HTML highlighting
void MarkupApply(file&, string, int); // Applies the HTML highlighting to the file
//void Substitute(file&, string); // substitutes portions of lines of text
//void Type(file&, int); // prints text to the screen
//void Copy(file, string[], int&); // copies text
//void Paste(file&, string[], int, int); // pastes text
//void Locate(file &, string); // finds text
//void Insert(file &, int); // inputs text to the array
//void Delete(file &, int); // deletes text
//void Replace(file &, int); // replaces while lines of text text
//void Move(file &, int); // moves the current line
//void Quit(file); // quits the program, asks the users if they want to save.
void Open(file &); // allows the user to open a file
void New(file &); // allows the user to create a file
void Save(file); // saves the array to a file.
void IndexPrint(file); // for debugging, this prints the contents of the array.
int main() // Main program
{
file txtFile;
txtFile.currentLineIndex=-1;
txtFile.total=0;
int inputValue=0, copyNumber;
string inputString, openYN, copyQue[MAX];
char inputChar, openYNtemp;
// ANIMATION LOOP GOES HERE
cout<<\"~~~\\033[1;32m Welcome \\033[0m~~~\ \"; // first use of colors in the program
cout<<\"Would you like to open an existing file? \"
<\'
Markup(txtFile, inputValue);
break;
case \'>\': // Unhighlight
txtFile.markupHighlighting=false; // if false, it\'ll go through the motions
Markup(txtFile, inputValue); // again, but revert to the original array
break; // afterward.
case \'*\': // * saves file to disk
Save(txtFile);
break;
case \'?\':
Help(); // \"I seem to be having difficulty with my lifestyle.\" -Arthur Dent
break;
case\'.\': // default for re-looping
break;
default:
cout<<\"\\033[1;31m\'\"< total: \"< currentLineIndex: \"<=80) // If it takes up the
entire default width of
{ // the window.
cout<<\"\\033[1;31m-That\'s a very long command, \"
<<\"I\'m just but a humble Line Editor.-\\033[0m \"<=8)
{
inputColor=0; // Default color
cout<<\.
Java Programming Below are the lexer token and shank file.pdf
Java Programming: Below are the lexer, token, and shank files with the shank.txt. Fix any error in
the files but make sure the shank.txt is being printed out in the terminal of eclipse. Show the full
code for all three files along with the screenshot of shank.txt being read in the terminal. Attached is
the rubric.
Lexer.java
package mypack;
import java.util.ArrayList;
import java.util.List;
import mypack.Token.TokenType;
import java .util.HashMap;
public class Lexer {
private static final int INTEGER_STATE = 1;
private static final int DECIMAL_STATE = 2;
private static final int IDENTIFIER_STATE = 3;
private static final int ERROR_STATE = 4;
private static final int SYMBOL_STATE = 5;
private static final int STRING_STATE = 6;
private static final int CHAR_STATE = 7;
private static final int COMMENT_STATE = 8;
private static final char EOF = (char) -1;
private static String input;
private static int index;
private static char currentChar;
private static int lineNumber = 1;
private static int indentLevel = 0;
private static int lastIndentLevel = 0;
private static HashMap<String, TokenType> keywords = new HashMap<String, TokenType>() {{
put("while", TokenType.WHILE);
put("if", TokenType.IF);
put("else", TokenType.ELSE);
put("print", TokenType.PRINT);
}};
private static HashMap<Character, TokenType> symbols = new HashMap<Character,
TokenType>() {{
put('+', TokenType.PLUS);
put('-', TokenType.MINUS);
put('*', TokenType.MULTIPLY);
put('/', TokenType.DIVIDE);
put('=', TokenType.EQUALS);
put(':', TokenType.COLON);
put(';', TokenType.SEMICOLON);
put('(', TokenType.LEFT_PAREN);
put(')', TokenType.RIGHT_PAREN);
put('{', TokenType.LEFT_BRACE);
put('}', TokenType.RIGHT_BRACE);
put('<', TokenType.LESS_THAN);
put('>', TokenType.GREATER_THAN);
}};
public Lexer(String input) {
Lexer.input = input;
index = 0;
currentChar = input.charAt(index);
}
private void nextChar() {
index++;
if (index >= input.length()) {
currentChar = EOF;
} else {
currentChar = input.charAt(index);
}
}
private void skipWhiteSpace() {
while (Character.isWhitespace(currentChar)) {
nextChar();
}
}
private int getIndentLevel() {
int level = 0;
int i = index;
char c = input.charAt(i);
while (c == ' ' || c == 't') {
if (c == 't') {
level += 1;
} else if (c == ' ') {
level += 1;
}
i++;
if (i >= input.length()) {
break;
}
c = input.charAt(i);
}
return level;
}
public List<Token> lex(String inputString) throws Exception {
input = inputString;
index = 0;
currentChar = input.charAt(index);
List<Token> tokens = new ArrayList<Token>();
while (currentChar != EOF) {
switch (currentState()) {
case INTEGER_STATE:
integerState(tokens);
break;
case DECIMAL_STATE:
decimalState(tokens);
break;
case IDENTIFIER_STATE:
identifierState(tokens);
break;
case ERROR_STATE:
errorState(tokens);
break;
case SYMBOL_STATE:
symbolState(tokens);
break;
case STRING_STATE:
stringState(tokens);
break;
case CHAR_STATE:
charState(tokens);
break;
case COMMENT_STATE:
commentState(tokens);
break;
default:
break;
}
}
return tokens.
Java Programming Below are the lexer token and shank file.pdf
Java Programming: Below are the lexer, token, and shank files with the shank.txt. Shank.java is
the main method file. The main goal is to make sure the shank.txt is being printed out in the
terminal of eclipse. Make sure there are no errors in the code at all. Show the screenshot of
shank.txt being read in the terminal. Attached is the rubric.
Lexer.java
package mypack;
import java.util.ArrayList;
import java.util.List;
import mypack.Token.TokenType;
import java .util.HashMap;
public class Lexer {
private static final int INTEGER_STATE = 1;
private static final int DECIMAL_STATE = 2;
private static final int IDENTIFIER_STATE = 3;
private static final int ERROR_STATE = 4;
private static final int SYMBOL_STATE = 5;
private static final int STRING_STATE = 6;
private static final int CHAR_STATE = 7;
private static final int COMMENT_STATE = 8;
private static final char EOF = (char) -1;
private static String input;
private static int index;
private static char currentChar;
private static int lineNumber = 1;
private static int indentLevel = 0;
private static int lastIndentLevel = 0;
private static HashMap<String, TokenType> keywords = new HashMap<String, TokenType>() {{
put("while", TokenType.WHILE);
put("if", TokenType.IF);
put("else", TokenType.ELSE);
put("print", TokenType.PRINT);
}};
private static HashMap<Character, TokenType> symbols = new HashMap<Character,
TokenType>() {{
put('+', TokenType.PLUS);
put('-', TokenType.MINUS);
put('*', TokenType.MULTIPLY);
put('/', TokenType.DIVIDE);
put('=', TokenType.EQUALS);
put(':', TokenType.COLON);
put(';', TokenType.SEMICOLON);
put('(', TokenType.LEFT_PAREN);
put(')', TokenType.RIGHT_PAREN);
put('{', TokenType.LEFT_BRACE);
put('}', TokenType.RIGHT_BRACE);
put('<', TokenType.LESS_THAN);
put('>', TokenType.GREATER_THAN);
}};
public Lexer(String input) {
Lexer.input = input;
index = 0;
currentChar = input.charAt(index);
}
private void nextChar() {
index++;
if (index >= input.length()) {
currentChar = EOF;
} else {
currentChar = input.charAt(index);
}
}
private void skipWhiteSpace() {
while (Character.isWhitespace(currentChar)) {
nextChar();
}
}
private int getIndentLevel() {
int level = 0;
int i = index;
char c = input.charAt(i);
while (c == ' ' || c == 't') {
if (c == 't') {
level += 1;
} else if (c == ' ') {
level += 1;
}
i++;
if (i >= input.length()) {
break;
}
c = input.charAt(i);
}
return level;
}
public List<Token> lex(String inputString) throws Exception {
input = inputString;
index = 0;
currentChar = input.charAt(index);
List<Token> tokens = new ArrayList<Token>();
while (currentChar != EOF) {
switch (currentState()) {
case INTEGER_STATE:
integerState(tokens);
break;
case DECIMAL_STATE:
decimalState(tokens);
break;
case IDENTIFIER_STATE:
identifierState(tokens);
break;
case ERROR_STATE:
errorState(tokens);
break;
case SYMBOL_STATE:
symbolState(tokens);
break;
case STRING_STATE:
stringState(tokens);
break;
case CHAR_STATE:
charState(tokens);
break;
case COMMENT_STATE:
commentState(tokens);
break;
def.
Lab01Filesbuild.bat@echo offclsset DRIVE_LETTER=1.docx
Lab01Files/build.bat
@echo off
cls
set DRIVE_LETTER=%1:
set PATH=%DRIVE_LETTER%\MinGW\bin;%DRIVE_LETTER%\MinGW\msys\1.0\bin;c:\Windows;c:\Windows\system32
g++ -c Keyboard.cpp
g++ -c Random.cpp
g++ -c String.cpp
g++ -c ReadFile.cpp
g++ -c WriteFile.cpp
g++ -c PlayerGuessDriver.cpp
g++ -o PlayerGuess.exe PlayerGuessDriver.o ReadFile.o WriteFile.o String.o Keyboard.o Random.o
Lab01Files/Keyboard.cpp
#include "Keyboard.h"
#include <iostream>
int readInt(string prompt)
{
cout << prompt;
int val = 0;
cin >> val;
return val;
}
int getValidatedInt(string prompt, int min, int max)
{
int validated = readInt(prompt);
cout << validated << endl;
while(validated < min || validated > max)
{
validated = readInt(prompt);
cout << validated << endl;
}
return validated;
}
double readDouble(string prompt)
{
cout << prompt;
double val = 0;
cin >> val;
return val;
}
double getValidatedDouble(string prompt, double min, double max)
{
double validated = readDouble(prompt);
cout << validated << endl;
while(validated < min || validated > max)
{
validated = readDouble(prompt);
cout << validated << endl;
}
return validated;
}
String* readString(string prompt)
{
cout << prompt;
string text;
getline(cin, text);
String* str = createString(text.c_str());
return str;
}
Lab01Files/Keyboard.h
#if !defined KEYBOARD
#define KEYBOARD
#include "Text.h"
#include <string>
using namespace std;
//pre: the string (character literal) that will prompt the user for input
//post: the input read from the keyboard interpreted as an int is returned
int readInt(string prompt);
int getValidatedInt(string prompt, int min, int max);
//pre: the string that will prompt the user for input
//post: the input read from the keyboard interpreted as a double is returned
double readDouble(string prompt);
double getValidatedDouble(string prompt, double min, double max);
//pre: the string that will prompt the user for input
// the string to store the user input and the length of the input storage string
//post: the text read from the keyboard is copied into the storage string
String* readString(string prompt);
#endif
Lab01Files/Laboratory 01_ Guessing Game.pdf
8/28/2014 Laboratory 01: Guessing Game
http://mboshart.dyndns.org/boshart/2111Labs/Lab01.html 1/3
Laboratory 01: Guessing Game
Download the following files and place them in your working directory:
Starting code for this lab:
Lab01Files.zip //provided, completed files, refer to header files for method
signatures
PlayerGuessDriver.cpp //most of the work is in this file
range.txt //contains the two integers that define the range for the secret
number
build.bat //convenience file for compiling and linking
Guessing Game
In this lab, you will write a simple guessing game. The computer will generate a
random integer within a valid spe ...
Introduction to pygments
Pygments is a Python package to syntax hightlight over 300 programming languages and text formats. This talk gives an overview on using the pygmentize tool to render source code as HTML, RTF or latex. It then explains the basics of lexers and tokens and show how to use the pygments API to implement source code converters. Finally a step by step life coding section describes how to implement your own lexer step by step.
C Programming Project
C Programming Projects -
1. Sort an array in ascending order.
2. Display sum of all odd values stored in an array.
3. Display number of even values stored in an array.
--
1. A file name is command line argument. Display the contents of the file where each word will be displayed on a new line. Display proper message if file does not exist.
2. Display no. of vowels stored in the file.
3. Display no. of “the” stored in the file.
4. Copy contents of the file to another file.
So I am writing a CS code for a project and I keep getting cannot .pdf
So I am writing a CS code for a project and I keep getting \"cannot open file\" I know I put it into
my code, but I don\'t know why it won\'t execute after i input ./a.out I put in gcc -Wall
contents3.c and no errors or warnings pop up. So I figure everything is working right. But after
that, I get \"Cannot open file\". So I am wondering what I can do to get this settled out properly. I
am putting the outcome of the project and my code. Please someone help me!
#include
#include
#include
#include
#include
#include
int len = 0;
int sp = 0;
int lwrcaseCount = 0;
int uprcaseCount = 0;
int digitCount = 0;
int specialCount = 0;
char data[200];
int frequency[84];
int sortFrequency[84][2];
char string[] =
\"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ!\\\"#$%&\'()*+,-
./:;<=>?@[/]^_`{|}~\";
//printf(\"\ \");
//To sort based on frequency of characters
/*void sort()
{
int max, loc, temp, x, y;
//Loops till end - 1 position of the frequency array
for(x = 0; x <= 84 - 1; x++)
{
//Initializes the max to the x position of the frequency array assuming it as maximum
max = frequency[x];
//Initializes of loc to x assuming location x contains the maximum value
loc = x;
//Loops through x + 1 to length - 1 of frequency array
for(y = x + 1; y <= 95 -1; y++)
{
//If current position of the frequency of the array is greater than the max
//then update the max with the current value of frequency and update the loc
if(frequency[y] > max)
{
max = frequency[y];
loc = y;
}//end of if
}//end of for loop
//If loc is not x then swap
if(loc != x)
{
temp = frequency[x];
frequency[x] = frequency[loc];
frequency[loc] = temp;
}//end of if
//Store the location of the maximum value in the zero column position of row x
sortFrequency[x][0]= loc;
//Store the maximum value in the first column position of row x
sortFrequency[x][1] = max;
}//end of for loop
}//end of function*/
void sort()
{
for(int i = 0; i < 84; i++)
{
sortFrequency[i][0] = i;
sortFrequency[i][1] = frequency[i];
}
for(int i = 0; i < 84-1; i++)
for(int j = 0; j < 84-i-1; j++)
if(sortFrequency[j][1] < sortFrequency[j+1][1])
{
int temp = sortFrequency[j][1];
sortFrequency[j][1] = sortFrequency[j+1][1];
sortFrequency[j+1][1] = temp;
temp = sortFrequency[j][0];
sortFrequency[j][0] = sortFrequency[j+1][0];
sortFrequency[j+1][0] = temp;
}
}
//To count frequency of each character
void frequencyCount()
{
int c, d;
//Loops till the length of the inputed data
for(c = 0; c < len; c++)
{
//Loops from 33 to 126 which is the ascii values of required characters range
for(d = 0; d < 84; d++)
{
//If the data in the current position is equal to the acii value
if(data[c] == string[d])
//Frequency 0 position is equal to 33 ascii.
//So 33 is deducted
frequency[d]++;
}//end of for loop
}//end of for loop
}//End of function
//Initializes the frequency array to zero
void initialize()
{
int c;
for(c = 0; c < 84; c++)
frequency[c] = 0;
}
//Read the file which contains data
void readFile()
{
//File pointer created
FILE *fptr;
char ch;
//Fi.
It’s sometimes useful to make a little language for a simple problem.pdf
IQ scores are normally distributed with a mean of 100 and a standard deviation of 15. What is
the probability a random sample of 40 people have a mean IQ score more than 80?
Solution
Mean ( u ) =100
Standard Deviation ( sd )=15
Number ( n ) = 40
Normal Distribution = Z= X- u / (sd/Sqrt(n) ~ N(0,1)
P(X > 80) = (80-100)/15/ Sqrt ( 40 )
= -20/2.372= -8.4327
= P ( Z >-8.4327) From Standard Normal Table
= 1.
Generating parsers using Ragel and Lemon
Have you ever wondered how you would implement a parser for simple arithmetic expressions in C++? Faced with this problem, many C++ programmers would generate a parser using Flex and Bison, or perhaps Boost Spirit. In this talk, I introduced some alternative tools, Ragel and Lemon, showing how they can be used to build a calculator that handles simple arithmetic expressions.
You have already implemented a lexical analyzer in Assignment #1 and.pdf
You have already implemented a lexical analyzer in Assignment #1 and a parser to recognize
grammatical rules in Assignment #2. In this assignment, you will be adding semantics to the
design of a small programming language to help implement blockchain. The goal of blockchain
is to allow digital information to be recorded and distributed, but not edited. In this way, a
blockchain is a foundation for immutable records of transactions that cannot be altered, deleted,
or destroyed. The semantics that you must implement in this assignment is as follows: 1. Each
time a new blockchain is created, you must extract attributes and verifies if each attribute has a
valid type. Returns false if at least one is invalid or returns true otherwise. 2. When the add
operator (keyword) is used, the data must be stored in a dictionary. 3. When errors are detected,
the parser must describe the error, including the line of the code where it occurs. 4. When
arithmetic expressions are used, the parser will implement the corresponding arithmetic
operations. For simplicity purposes, the blockchain only will store arithmetic expressions and
strings.
import ply.lex as lex
import ply.yacc as yacc
tokens = (
'ID',
'BLOCK',
'VAR',
'ADD',
'PRINT',
'VIEW',
'RUN',
'MINE',
'EXPORT',
'STRING',
'INT',
'LONG',
'FLOAT',
'LIST',
'TUPLE',
'DICT',
'NUMBER',
'ASSIGN',
'TYPEASSIGN',
'SEPARATOR',
'LPAREN',
'RPAREN',
'NE',
'LT',
'GT',
'LE',
'GE',
'PLUS',
'MINUS',
'STAR',
'SLASH',
'PCT',
'COMMENT',
'WHITESPACE'
)
t_ASSIGN = r'\='
t_TYPEASSIGN = r'\:'
t_SEPARATOR = r'\,'
t_LPAREN = r'\('
t_RPAREN = r'\)'
t_NE = r'\!='
t_LT = r'\<'
t_GT = r'\>'
t_LE = r'\<='
t_GE = r'\>='
t_PLUS = r'\+'
t_MINUS = r'\-'
t_STAR = r'\*'
t_SLASH = r'\/'
t_PCT = r'\%'
t_ignore_COMMENT = r'\#.'
t_ignore_WHITESPACE = r'\s+'
keywords = {
'BLOCK': 'KEYWORD',
'VAR': 'KEYWORD',
'ADD': 'KEYWORD',
'PRINT': 'KEYWORD',
'VIEW': 'KEYWORD',
'RUN': 'KEYWORD',
'MINE': 'KEYWORD',
'EXPORT': 'KEYWORD',
'STR':'KEYWORD',
'INT': 'KEYWORD',
'LONG': 'KEYWORD',
'FLOAT': 'KEYWORD',
'LIST': 'KEYWORD',
'TUPLE': 'KEYWORD',
'DICT':'KEYWORD',
}
tokens1 = ['ID',
'BLOCK','VAR','ADD','PRINT','VIEW','RUN','MINE','EXPORT','STRING','LONG','FLOAT','L
IST','TUPLE','DICT','NUMBER','ASSIGN','TYPEASSIGN','SEPARATOR','LPAREN','RPARE
N','NE','LT','GT','LE','GE','PLUS','MINUS','STAR','SLASH', 'PCT',
'COMMENT','WHITESPACE']\
+ list(keywords.values())
# dictionary to store values
values = {}
def t_KEYWORD(t):
r'DEF | VAR | INT | IF | ELSE'
t.type = keywords.get(t.value, 'KEYWORD')
return t
def t_ID(t):
r'[a-zA-Z_][a-zA-Z_0-9]*'
t.type = keywords.get(t.value, 'ID')
return t
def t_NUM(t):
r'[0-9]+'
t.type = keywords.get(t.value, 'INT')
return t
def t_COMMENT(t):
r'//.'
t.type = keywords.get(t.value, 'COMMENT')
pass
def t_newline(t):
r'\n+'
t.lexer.lineno += len(t.value)
def t_error(t):
print("Illegal character '%s'" % t.value[0])
t.lexer.skip(1)
def p_block(p):
"""
block : BLOCK ID ASSIGN LPAREN attributes RPAREN
| ADD ID ASSIGN LPAREN new_atts RPAREN
| PRINT I.
finalprojtemplatev5finalprojtemplate.gitignore# Ignore the b
finalprojtemplatev5/finalprojtemplate/.gitignore
# Ignore the build directory
build
# Ignore any executables
bin/*
# Ignore Mac specific files
.DS_Store
finalprojtemplatev5/finalprojtemplate/Makefile
# Script adapted from https://hiltmon.com/blog/2013/07/03/a-simple-c-plus-plus-project-structure/
CC := /usr/local/classes/eecs/spring2021/cs472/public/gcc/bin/g++
STRIPUTIL = strip
SRCDIR = src
BUILDDIR = build
TARGET = bin/cache_sim
# Handle debug case
DEBUG ?= 1
ifeq ($(DEBUG), 1)
CFLAGS += -g -Wall
else
CFLAGS += -DNDEBUG -O3
endif
SRCEXT = cpp
SOURCES = $(shell find $(SRCDIR) -type f -name *.$(SRCEXT))
OBJECTS = $(patsubst $(SRCDIR)/%,$(BUILDDIR)/%,$(SOURCES:.$(SRCEXT)=.o))
LDFLAGS += -Wl,-rpath,/usr/local/classes/eecs/spring2021/cs472/public/gcc/lib64
LIB += -pthread
INC += -I $(SRCDIR)
$(TARGET): $(OBJECTS)
@echo "Linking..."
@echo " $(CC) $^ -o $(TARGET) $(LIB) $(LDFLAGS)"; $(CC) $^ -o $(TARGET) $(LIB) $(LDFLAGS)
$(BUILDDIR)/%.o: $(SRCDIR)/%.$(SRCEXT)
@mkdir -p $(BUILDDIR)
@echo " $(CC) $(CFLAGS) $(INC) -c -o [email protected] $<"; $(CC) $(CFLAGS) $(INC) -c -o [email protected] $<
clean:
@echo "Cleaning...";
@echo " $(RM) -r $(BUILDDIR) $(TARGET)"; $(RM) -r $(BUILDDIR) $(TARGET)
.PHONY: clean
finalprojtemplatev5/finalprojtemplate/resources/simpletracefile==This is a simple tracefile for testing purposes L 08 L 808 L 1006 L 08 S 1805 L 1002 L 808 M 1806 L 1008 S 1005 S 1808 L 808 M 08 M 04 L 2804 M 808
finalprojtemplatev5/finalprojtemplate/resources/testconfig
1
230
8
16
3
1
0
13
finalprojtemplatev5/finalprojtemplate/src/CacheController.cppfinalprojtemplatev5/finalprojtemplate/src/CacheController.cpp/*
Cache Simulator (Starter Code) by Justin Goins
Oregon State University
Spring Term 2021
*/
#include"CacheController.h"
#include<iostream>
#include<fstream>
#include<regex>
#include<cmath>
usingnamespace std;
CacheController::CacheController(CacheInfo ci, string tracefile){
// store the configuration info
this->ci = ci;
this->inputFile = tracefile;
this->outputFile =this->inputFile +".out";
// compute the other cache parameters
this->ci.numByteOffsetBits = log2(ci.blockSize);
this->ci.numSetIndexBits = log2(ci.numberSets);
// initialize the counters
this->globalCycles =0;
this->globalHits =0;
this->globalMisses =0;
this->globalEvictions =0;
// create your cache structure
// ...
// manual test code to see if the cache is behaving properly
// will need to be changed slightly to match the function prototype
/*
cacheAccess(false, 0);
cacheAccess(false, 128);
cacheAccess(false, 256);
cacheAccess(false, 0);
cacheAccess(false, 128);
cacheAccess(false, 256);
*/
}
/*
Starts reading the tracefile and processing memory operations.
*/
voidCacheController::runTracefile(){
cout <<"Input tracefile: "<< inputFile << endl;
cout <<"Output file name: "<< outputFile << endl;
// process each input line
string line;
// define regular expressions that are used to locate ...
More Related Content
Similar to 20DCE096_dlp_prac3.pdf
Introduction to pygments
Pygments is a Python package to syntax hightlight over 300 programming languages and text formats. This talk gives an overview on using the pygmentize tool to render source code as HTML, RTF or latex. It then explains the basics of lexers and tokens and show how to use the pygments API to implement source code converters. Finally a step by step life coding section describes how to implement your own lexer step by step.
C Programming Project
C Programming Projects -
1. Sort an array in ascending order.
2. Display sum of all odd values stored in an array.
3. Display number of even values stored in an array.
--
1. A file name is command line argument. Display the contents of the file where each word will be displayed on a new line. Display proper message if file does not exist.
2. Display no. of vowels stored in the file.
3. Display no. of “the” stored in the file.
4. Copy contents of the file to another file.
So I am writing a CS code for a project and I keep getting cannot .pdf
So I am writing a CS code for a project and I keep getting \"cannot open file\" I know I put it into
my code, but I don\'t know why it won\'t execute after i input ./a.out I put in gcc -Wall
contents3.c and no errors or warnings pop up. So I figure everything is working right. But after
that, I get \"Cannot open file\". So I am wondering what I can do to get this settled out properly. I
am putting the outcome of the project and my code. Please someone help me!
#include
#include
#include
#include
#include
#include
int len = 0;
int sp = 0;
int lwrcaseCount = 0;
int uprcaseCount = 0;
int digitCount = 0;
int specialCount = 0;
char data[200];
int frequency[84];
int sortFrequency[84][2];
char string[] =
\"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ!\\\"#$%&\'()*+,-
./:;<=>?@[/]^_`{|}~\";
//printf(\"\ \");
//To sort based on frequency of characters
/*void sort()
{
int max, loc, temp, x, y;
//Loops till end - 1 position of the frequency array
for(x = 0; x <= 84 - 1; x++)
{
//Initializes the max to the x position of the frequency array assuming it as maximum
max = frequency[x];
//Initializes of loc to x assuming location x contains the maximum value
loc = x;
//Loops through x + 1 to length - 1 of frequency array
for(y = x + 1; y <= 95 -1; y++)
{
//If current position of the frequency of the array is greater than the max
//then update the max with the current value of frequency and update the loc
if(frequency[y] > max)
{
max = frequency[y];
loc = y;
}//end of if
}//end of for loop
//If loc is not x then swap
if(loc != x)
{
temp = frequency[x];
frequency[x] = frequency[loc];
frequency[loc] = temp;
}//end of if
//Store the location of the maximum value in the zero column position of row x
sortFrequency[x][0]= loc;
//Store the maximum value in the first column position of row x
sortFrequency[x][1] = max;
}//end of for loop
}//end of function*/
void sort()
{
for(int i = 0; i < 84; i++)
{
sortFrequency[i][0] = i;
sortFrequency[i][1] = frequency[i];
}
for(int i = 0; i < 84-1; i++)
for(int j = 0; j < 84-i-1; j++)
if(sortFrequency[j][1] < sortFrequency[j+1][1])
{
int temp = sortFrequency[j][1];
sortFrequency[j][1] = sortFrequency[j+1][1];
sortFrequency[j+1][1] = temp;
temp = sortFrequency[j][0];
sortFrequency[j][0] = sortFrequency[j+1][0];
sortFrequency[j+1][0] = temp;
}
}
//To count frequency of each character
void frequencyCount()
{
int c, d;
//Loops till the length of the inputed data
for(c = 0; c < len; c++)
{
//Loops from 33 to 126 which is the ascii values of required characters range
for(d = 0; d < 84; d++)
{
//If the data in the current position is equal to the acii value
if(data[c] == string[d])
//Frequency 0 position is equal to 33 ascii.
//So 33 is deducted
frequency[d]++;
}//end of for loop
}//end of for loop
}//End of function
//Initializes the frequency array to zero
void initialize()
{
int c;
for(c = 0; c < 84; c++)
frequency[c] = 0;
}
//Read the file which contains data
void readFile()
{
//File pointer created
FILE *fptr;
char ch;
//Fi.
It’s sometimes useful to make a little language for a simple problem.pdf
IQ scores are normally distributed with a mean of 100 and a standard deviation of 15. What is
the probability a random sample of 40 people have a mean IQ score more than 80?
Solution
Mean ( u ) =100
Standard Deviation ( sd )=15
Number ( n ) = 40
Normal Distribution = Z= X- u / (sd/Sqrt(n) ~ N(0,1)
P(X > 80) = (80-100)/15/ Sqrt ( 40 )
= -20/2.372= -8.4327
= P ( Z >-8.4327) From Standard Normal Table
= 1.
Generating parsers using Ragel and Lemon
Have you ever wondered how you would implement a parser for simple arithmetic expressions in C++? Faced with this problem, many C++ programmers would generate a parser using Flex and Bison, or perhaps Boost Spirit. In this talk, I introduced some alternative tools, Ragel and Lemon, showing how they can be used to build a calculator that handles simple arithmetic expressions.
You have already implemented a lexical analyzer in Assignment #1 and.pdf
You have already implemented a lexical analyzer in Assignment #1 and a parser to recognize
grammatical rules in Assignment #2. In this assignment, you will be adding semantics to the
design of a small programming language to help implement blockchain. The goal of blockchain
is to allow digital information to be recorded and distributed, but not edited. In this way, a
blockchain is a foundation for immutable records of transactions that cannot be altered, deleted,
or destroyed. The semantics that you must implement in this assignment is as follows: 1. Each
time a new blockchain is created, you must extract attributes and verifies if each attribute has a
valid type. Returns false if at least one is invalid or returns true otherwise. 2. When the add
operator (keyword) is used, the data must be stored in a dictionary. 3. When errors are detected,
the parser must describe the error, including the line of the code where it occurs. 4. When
arithmetic expressions are used, the parser will implement the corresponding arithmetic
operations. For simplicity purposes, the blockchain only will store arithmetic expressions and
strings.
import ply.lex as lex
import ply.yacc as yacc
tokens = (
'ID',
'BLOCK',
'VAR',
'ADD',
'PRINT',
'VIEW',
'RUN',
'MINE',
'EXPORT',
'STRING',
'INT',
'LONG',
'FLOAT',
'LIST',
'TUPLE',
'DICT',
'NUMBER',
'ASSIGN',
'TYPEASSIGN',
'SEPARATOR',
'LPAREN',
'RPAREN',
'NE',
'LT',
'GT',
'LE',
'GE',
'PLUS',
'MINUS',
'STAR',
'SLASH',
'PCT',
'COMMENT',
'WHITESPACE'
)
t_ASSIGN = r'\='
t_TYPEASSIGN = r'\:'
t_SEPARATOR = r'\,'
t_LPAREN = r'\('
t_RPAREN = r'\)'
t_NE = r'\!='
t_LT = r'\<'
t_GT = r'\>'
t_LE = r'\<='
t_GE = r'\>='
t_PLUS = r'\+'
t_MINUS = r'\-'
t_STAR = r'\*'
t_SLASH = r'\/'
t_PCT = r'\%'
t_ignore_COMMENT = r'\#.'
t_ignore_WHITESPACE = r'\s+'
keywords = {
'BLOCK': 'KEYWORD',
'VAR': 'KEYWORD',
'ADD': 'KEYWORD',
'PRINT': 'KEYWORD',
'VIEW': 'KEYWORD',
'RUN': 'KEYWORD',
'MINE': 'KEYWORD',
'EXPORT': 'KEYWORD',
'STR':'KEYWORD',
'INT': 'KEYWORD',
'LONG': 'KEYWORD',
'FLOAT': 'KEYWORD',
'LIST': 'KEYWORD',
'TUPLE': 'KEYWORD',
'DICT':'KEYWORD',
}
tokens1 = ['ID',
'BLOCK','VAR','ADD','PRINT','VIEW','RUN','MINE','EXPORT','STRING','LONG','FLOAT','L
IST','TUPLE','DICT','NUMBER','ASSIGN','TYPEASSIGN','SEPARATOR','LPAREN','RPARE
N','NE','LT','GT','LE','GE','PLUS','MINUS','STAR','SLASH', 'PCT',
'COMMENT','WHITESPACE']\
+ list(keywords.values())
# dictionary to store values
values = {}
def t_KEYWORD(t):
r'DEF | VAR | INT | IF | ELSE'
t.type = keywords.get(t.value, 'KEYWORD')
return t
def t_ID(t):
r'[a-zA-Z_][a-zA-Z_0-9]*'
t.type = keywords.get(t.value, 'ID')
return t
def t_NUM(t):
r'[0-9]+'
t.type = keywords.get(t.value, 'INT')
return t
def t_COMMENT(t):
r'//.'
t.type = keywords.get(t.value, 'COMMENT')
pass
def t_newline(t):
r'\n+'
t.lexer.lineno += len(t.value)
def t_error(t):
print("Illegal character '%s'" % t.value[0])
t.lexer.skip(1)
def p_block(p):
"""
block : BLOCK ID ASSIGN LPAREN attributes RPAREN
| ADD ID ASSIGN LPAREN new_atts RPAREN
| PRINT I.
finalprojtemplatev5finalprojtemplate.gitignore# Ignore the b
finalprojtemplatev5/finalprojtemplate/.gitignore
# Ignore the build directory
build
# Ignore any executables
bin/*
# Ignore Mac specific files
.DS_Store
finalprojtemplatev5/finalprojtemplate/Makefile
# Script adapted from https://hiltmon.com/blog/2013/07/03/a-simple-c-plus-plus-project-structure/
CC := /usr/local/classes/eecs/spring2021/cs472/public/gcc/bin/g++
STRIPUTIL = strip
SRCDIR = src
BUILDDIR = build
TARGET = bin/cache_sim
# Handle debug case
DEBUG ?= 1
ifeq ($(DEBUG), 1)
CFLAGS += -g -Wall
else
CFLAGS += -DNDEBUG -O3
endif
SRCEXT = cpp
SOURCES = $(shell find $(SRCDIR) -type f -name *.$(SRCEXT))
OBJECTS = $(patsubst $(SRCDIR)/%,$(BUILDDIR)/%,$(SOURCES:.$(SRCEXT)=.o))
LDFLAGS += -Wl,-rpath,/usr/local/classes/eecs/spring2021/cs472/public/gcc/lib64
LIB += -pthread
INC += -I $(SRCDIR)
$(TARGET): $(OBJECTS)
@echo "Linking..."
@echo " $(CC) $^ -o $(TARGET) $(LIB) $(LDFLAGS)"; $(CC) $^ -o $(TARGET) $(LIB) $(LDFLAGS)
$(BUILDDIR)/%.o: $(SRCDIR)/%.$(SRCEXT)
@mkdir -p $(BUILDDIR)
@echo " $(CC) $(CFLAGS) $(INC) -c -o [email protected] $<"; $(CC) $(CFLAGS) $(INC) -c -o [email protected] $<
clean:
@echo "Cleaning...";
@echo " $(RM) -r $(BUILDDIR) $(TARGET)"; $(RM) -r $(BUILDDIR) $(TARGET)
.PHONY: clean
finalprojtemplatev5/finalprojtemplate/resources/simpletracefile==This is a simple tracefile for testing purposes L 08 L 808 L 1006 L 08 S 1805 L 1002 L 808 M 1806 L 1008 S 1005 S 1808 L 808 M 08 M 04 L 2804 M 808
finalprojtemplatev5/finalprojtemplate/resources/testconfig
1
230
8
16
3
1
0
13
finalprojtemplatev5/finalprojtemplate/src/CacheController.cppfinalprojtemplatev5/finalprojtemplate/src/CacheController.cpp/*
Cache Simulator (Starter Code) by Justin Goins
Oregon State University
Spring Term 2021
*/
#include"CacheController.h"
#include<iostream>
#include<fstream>
#include<regex>
#include<cmath>
usingnamespace std;
CacheController::CacheController(CacheInfo ci, string tracefile){
// store the configuration info
this->ci = ci;
this->inputFile = tracefile;
this->outputFile =this->inputFile +".out";
// compute the other cache parameters
this->ci.numByteOffsetBits = log2(ci.blockSize);
this->ci.numSetIndexBits = log2(ci.numberSets);
// initialize the counters
this->globalCycles =0;
this->globalHits =0;
this->globalMisses =0;
this->globalEvictions =0;
// create your cache structure
// ...
// manual test code to see if the cache is behaving properly
// will need to be changed slightly to match the function prototype
/*
cacheAccess(false, 0);
cacheAccess(false, 128);
cacheAccess(false, 256);
cacheAccess(false, 0);
cacheAccess(false, 128);
cacheAccess(false, 256);
*/
}
/*
Starts reading the tracefile and processing memory operations.
*/
voidCacheController::runTracefile(){
cout <<"Input tracefile: "<< inputFile << endl;
cout <<"Output file name: "<< outputFile << endl;
// process each input line
string line;
// define regular expressions that are used to locate ...
Similar to 20DCE096_dlp_prac3.pdf (20)
So I am writing a CS code for a project and I keep getting cannot .pdf
So I am writing a CS code for a project and I keep getting cannot .pdf
It’s sometimes useful to make a little language for a simple problem.pdf
It’s sometimes useful to make a little language for a simple problem.pdf
You have already implemented a lexical analyzer in Assignment #1 and.pdf
You have already implemented a lexical analyzer in Assignment #1 and.pdf
finalprojtemplatev5finalprojtemplate.gitignore# Ignore the b
finalprojtemplatev5finalprojtemplate.gitignore# Ignore the b
More from ShivangPithadiya1
More from ShivangPithadiya1 (7)
Recently uploaded
NUMERICAL SIMULATIONS OF HEAT AND MASS TRANSFER IN CONDENSING HEAT EXCHANGERS...
Power plants release a large amount of water vapor into the
atmosphere through the stack. The flue gas can be a potential
source for obtaining much needed cooling water for a power
plant. If a power plant could recover and reuse a portion of this
moisture, it could reduce its total cooling water intake
requirement. One of the most practical way to recover water
from flue gas is to use a condensing heat exchanger. The power
plant could also recover latent heat due to condensation as well
as sensible heat due to lowering the flue gas exit temperature.
Additionally, harmful acids released from the stack can be
reduced in a condensing heat exchanger by acid condensation. reduced in a condensing heat exchanger by acid condensation.
Condensation of vapors in flue gas is a complicated
phenomenon since heat and mass transfer of water vapor and
various acids simultaneously occur in the presence of noncondensable
gases such as nitrogen and oxygen. Design of a
condenser depends on the knowledge and understanding of the
heat and mass transfer processes. A computer program for
numerical simulations of water (H2O) and sulfuric acid (H2SO4)
condensation in a flue gas condensing heat exchanger was
developed using MATLAB. Governing equations based on
mass and energy balances for the system were derived to
predict variables such as flue gas exit temperature, cooling
water outlet temperature, mole fraction and condensation rates
of water and sulfuric acid vapors. The equations were solved
using an iterative solution technique with calculations of heat
and mass transfer coefficients and physical properties.
一比一原版(SFU毕业证)西蒙菲莎大学毕业证成绩单如何办理
SFU毕业证原版定制【微信：176555708】【西蒙菲莎大学毕业证成绩单-学位证】【微信：176555708】（留信学历认证永久存档查询）采用学校原版纸张、特殊工艺完全按照原版一比一制作（包括：隐形水印，阴影底纹，钢印LOGO烫金烫银，LOGO烫金烫银复合重叠，文字图案浮雕，激光镭射，紫外荧光，温感，复印防伪）行业标杆！精益求精，诚心合作，真诚制作！多年品质 ,按需精细制作，24小时接单,全套进口原装设备，十五年致力于帮助留学生解决难题，业务范围有加拿大、英国、澳洲、韩国、美国、新加坡，新西兰等学历材料，包您满意。
◆◆◆◆◆ — — — — — — — — 【留学教育】留学归国服务中心 — — — — — -◆◆◆◆◆
【主营项目】
一.毕业证【微信：176555708】成绩单、使馆认证、教育部认证、雅思托福成绩单、学生卡等！
二.真实使馆公证(即留学回国人员证明,不成功不收费)
三.真实教育部学历学位认证（教育部存档！教育部留服网站永久可查）
四.办理各国各大学文凭(一对一专业服务,可全程监控跟踪进度)
如果您处于以下几种情况：
◇在校期间，因各种原因未能顺利毕业……拿不到官方毕业证【微信：176555708】
◇面对父母的压力，希望尽快拿到；
◇不清楚认证流程以及材料该如何准备；
◇回国时间很长，忘记办理；
◇回国马上就要找工作，办给用人单位看；
◇企事业单位必须要求办理的
◇需要报考公务员、购买免税车、落转户口
◇申请留学生创业基金
留信网认证的作用:
1:该专业认证可证明留学生真实身份
2:同时对留学生所学专业登记给予评定
3:国家专业人才认证中心颁发入库证书
4:这个认证书并且可以归档倒地方
5:凡事获得留信网入网的信息将会逐步更新到个人身份内，将在公安局网内查询个人身份证信息后，同步读取人才网入库信息
6:个人职称评审加20分
7:个人信誉贷款加10分→ 【关于价格问题（保证一手价格）
我们所定的价格是非常合理的，而且我们现在做得单子大多数都是代理和回头客户介绍的所以一般现在有新的单子 我给客户的都是第一手的代理价格，因为我想坦诚对待大家 不想跟大家在价格方面浪费时间
对于老客户或者被老客户介绍过来的朋友，我们都会适当给一些优惠。
8:在国家人才网主办的国家网络招聘大会中纳入资料，供国家高端企业选择人才
选择实体注册公司办理，更放心，更安全！我们的承诺：可来公司面谈，可签订合同，会陪同客户一起到教育部认证窗口递交认证材料，客户在教育部官方认证查询网站查询到认证通过结果后付款，不成功不收费！
学历顾问：微信：176555708
NO1 Uk best vashikaran specialist in delhi vashikaran baba near me online vas...
NO1 Uk best vashikaran specialist in delhi vashikaran baba near me online vas...Amil Baba Dawood bangali
Contact with Dawood Bhai Just call on +92322-6382012 and we'll help you. We'll solve all your problems within 12 to 24 hours and with 101% guarantee and with astrology systematic. If you want to take any personal or professional advice then also you can call us on +92322-6382012 , ONLINE LOVE PROBLEM & Other all types of Daily Life Problem's.Then CALL or WHATSAPP us on +92322-6382012 and Get all these problems solutions here by Amil Baba DAWOOD BANGALI
#vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore#blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #blackmagicforlove #blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #Amilbabainuk #amilbabainspain #amilbabaindubai #Amilbabainnorway #amilbabainkrachi #amilbabainlahore #amilbabaingujranwalan #amilbabainislamabad
Water Industry Process Automation and Control Monthly - May 2024.pdf
Water Industry Process Automation and Control Monthly - May 2024.pdfWater Industry Process Automation & Control
Welcome to WIPAC Monthly the magazine brought to you by the LinkedIn Group Water Industry Process Automation & Control.
In this month's edition, along with this month's industry news to celebrate the 13 years since the group was created we have articles including
A case study of the used of Advanced Process Control at the Wastewater Treatment works at Lleida in Spain
A look back on an article on smart wastewater networks in order to see how the industry has measured up in the interim around the adoption of Digital Transformation in the Water Industry.AKS UNIVERSITY Satna Final Year Project By OM Hardaha.pdf
AKS UNIVERSITY Satna Final Year Project By OM Hardaha.
Thank me later.
samsarthak31@gmail.com
Building Electrical System Design & Installation
Guide for Building Electrical System Design & Installation
Gen AI Study Jams _ For the GDSC Leads in India.pdf
Gen AI Study Jams _ For the GDSC Leads in India.pdf
Design and Analysis of Algorithms-DP,Backtracking,Graphs,B&B
Dynamic Programming
Backtracking
Techniques for Graphs
Branch and Bound
Industrial Training at Shahjalal Fertilizer Company Limited (SFCL)
This presentation is about the working procedure of Shahjalal Fertilizer Company Limited (SFCL). A Govt. owned Company of Bangladesh Chemical Industries Corporation under Ministry of Industries.
Cosmetic shop management system project report.pdf
Buying new cosmetic products is difficult. It can even be scary for those who have sensitive skin and are prone to skin trouble. The information needed to alleviate this problem is on the back of each product, but it's thought to interpret those ingredient lists unless you have a background in chemistry.
Instead of buying and hoping for the best, we can use data science to help us predict which products may be good fits for us. It includes various function programs to do the above mentioned tasks.
Data file handling has been effectively used in the program.
The automated cosmetic shop management system should deal with the automation of general workflow and administration process of the shop. The main processes of the system focus on customer's request where the system is able to search the most appropriate products and deliver it to the customers. It should help the employees to quickly identify the list of cosmetic product that have reached the minimum quantity and also keep a track of expired date for each cosmetic product. It should help the employees to find the rack number in which the product is placed.It is also Faster and more efficient way.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
Investor-Presentation-Q1FY2024 investor presentation document.pptx
this is the investor presemtaiton document for qurrter 1 2024
Recently uploaded (20)
NUMERICAL SIMULATIONS OF HEAT AND MASS TRANSFER IN CONDENSING HEAT EXCHANGERS...
NUMERICAL SIMULATIONS OF HEAT AND MASS TRANSFER IN CONDENSING HEAT EXCHANGERS...
NO1 Uk best vashikaran specialist in delhi vashikaran baba near me online vas...
NO1 Uk best vashikaran specialist in delhi vashikaran baba near me online vas...
Water Industry Process Automation and Control Monthly - May 2024.pdf
Water Industry Process Automation and Control Monthly - May 2024.pdf
AKS UNIVERSITY Satna Final Year Project By OM Hardaha.pdf
AKS UNIVERSITY Satna Final Year Project By OM Hardaha.pdf
Gen AI Study Jams _ For the GDSC Leads in India.pdf
Gen AI Study Jams _ For the GDSC Leads in India.pdf
Design and Analysis of Algorithms-DP,Backtracking,Graphs,B&B
Design and Analysis of Algorithms-DP,Backtracking,Graphs,B&B
Industrial Training at Shahjalal Fertilizer Company Limited (SFCL)
Industrial Training at Shahjalal Fertilizer Company Limited (SFCL)
Fundamentals of Electric Drives and its applications.pptx
Fundamentals of Electric Drives and its applications.pptx
MCQ Soil mechanics questions (Soil shear strength).pdf
MCQ Soil mechanics questions (Soil shear strength).pdf
Cosmetic shop management system project report.pdf
Cosmetic shop management system project report.pdf
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...
Investor-Presentation-Q1FY2024 investor presentation document.pptx
Investor-Presentation-Q1FY2024 investor presentation document.pptx
block diagram and signal flow graph representation
block diagram and signal flow graph representation
20DCE096_dlp_prac3.pdf
- 1. 20DCE096 CE442: DESIGN OF LANGUAGE PROCESSOR 8 PRACTICAL - 3 Aim: Implement a l a lexical analyzer for the identification of numbers. Code: #include <stdio.h> #include <string.h> #include <ctype.h> // Define token types enum TokenType { LITERAL, }; // Function to classify and print tokens void printToken(char* lexeme, enum TokenType type) { char* tokenTypeStr; switch (type) { case LITERAL: tokenTypeStr = "Literal"; break; default: tokenTypeStr = "Unknown"; } printf("Type: %s, Lexeme: %sn", tokenTypeStr, lexeme); } int main() { FILE *file = fopen("input.txt", "r"); // Open the file in read mode if (file == NULL) { perror("Error opening file"); return 1; } char input[1000]; char lexeme[1000]; int i = 0; int j = 0; while (fgets(input, sizeof(input), file) != NULL) { for (i = 0; i < strlen(input); i++) { // Check for numeric literals if (isdigit(input[i])) { j = 0; while (isdigit(input[i]) || input[i] == '.') {
- 2. 20DCE096 CE442: DESIGN OF LANGUAGE PROCESSOR 9 lexeme[j++] = input[i++]; } lexeme[j] = '0'; printToken(lexeme, LITERAL); i--; } } } fclose(file); // Close the file return 0; } Output: Conclusion: In this practical we implement lexical analyser which identify only number from the given file content. Grade: Signature: Remarks: