Show Posts
This section allows you to view all posts made by this member. Note that you can only see posts made in areas you currently have access to.
public abstract class Symbol {
private char symbol;
......... //constructor
@Override
public String toString() {
return new Character(symbol).toString();
}
}
public class Nonterminal extends Symbol {
........ //constructors
@Override
public String toString() {
return super.toString();
}
}
public class Terminal extends Symbol {
..... //constructors
@Override
public String toString() {
return super.toString();
}
}
......
Nonterminal nt = new Nonterminal("S");
Terminal st = new Terminal("S");
if(nt.equals(st)){
System.out.println("It works");
}
.....
Makes me want to learn java better.
//Adds operators to list
private void getOperators(){
operators.add("<"); operators.add(">");
operators.add("lt"); operators.add("gt");
operators.add("="); operators.add("equals");
operators.add("plus"); operators.add("minus");
}
//Adds reserved words to list
private void getReservedWords(){
reservedWords.add("if"); reservedWords.add("else"); reservedWords.add("while");
reservedWords.add("int"); reservedWords.add("char"); reservedWords.add("string");
reservedWords.add("main"); reservedWords.add("cin>>"); reservedWords.add("cout<<"); //really skipping that look ahead step here :D
}
//Adds separators to list
private void getSeparators(){
sepList.add("("); sepList.add(")"); sepList.add(",");
sepList.add(";"); sepList.add("["); sepList.add("]");
}
//Adds codification to list
private void getCodification(){
codification.add("identifier");
codification.add("constant");
codification.add("main");
codification.add("int");
codification.add("char");
codification.add("string");
codification.add("cout<<");
codification.add("cin>>");
codification.add("while");
codification.add("if");
codification.add("else");
codification.add(";");
codification.add(",");
codification.add("[");
codification.add("]");
codification.add("(");
codification.add(")");
codification.add("plus");
codification.add("minus");
codification.add("<");
codification.add(">");
codification.add("=");
codification.add("lt");
codification.add("gt");
codification.add("equals");
}
//Bubble sort for SymbolTable type elements in a list, alphabetically after token
//Yes bubble sort.
/* Note this was a particular requirement, it could have been done way more elegantly, but not when one is out of time. */
public void sortST(List<SymbolTable> list){
for(int i=0; i<list.size();i++){
for(int j=1; j<(list.size()-i);j++){
if(list.get(j-1).getToken().compareTo(list.get(j).getToken()) > 0 ){
SymbolTable aux = new SymbolTable(list.get(j-1).getToken(), list.get(j-1).getPosition());
SymbolTable aux1 = new SymbolTable(list.get(j).getToken(), list.get(j).getPosition());
list.set(j-1, aux1);
list.set(j, aux);
}
}
}
}
//Adds token in PIF or SymbolTable
public void classify(String token, Integer nr){
//System.out.println(token + "Here token");
int aux=0,index = 0, aux1=0, index1=0;
if(nr==0){
for(int i=0; i<codification.size(); i++){
if(codification.get(i).equals(token)){
Classification item = new Classification(i,nr);
pif.add(item);
break;
}
}
return;
}
if(nr==1){
if(symbolTableC.isEmpty()){
SymbolTable pair = new SymbolTable(token,1);
symbolTableC.add(pair);
}
for(int i =0; i< symbolTableC.size(); i++){
if(symbolTableC.get(i).getToken().equals(token)== true){
Classification item = new Classification(nr, symbolTableC.get(i).getPosition());
pif.add(item);
aux++;
break;
}
index=i;
}
if(aux==0){
int poz = symbolTableC.get(index).getPosition() +1;
SymbolTable pair = new SymbolTable(token, poz);
symbolTableC.add(pair);
Classification item = new Classification(nr, poz);
pif.add(item);
}
return;
}
if(nr == 2){
if(symbolTableI.isEmpty()){
SymbolTable pair = new SymbolTable(token,1);
symbolTableI.add(pair);
}
for(int i =0; i< symbolTableI.size(); i++){
if(symbolTableI.get(i).getToken().equals(token)== true){
Classification item = new Classification(0, symbolTableI.get(i).getPosition());
pif.add(item);
aux1++;
break;
}
index1=i;
}
if(aux1==0){
int poz = symbolTableI.get(index1).getPosition() +1;
SymbolTable pair = new SymbolTable(token, poz);
symbolTableI.add(pair);
Classification item = new Classification(0, poz);
pif.add(item);
}
return;
}
}
//Algorithm that determines if token is op/resW/sep/constant/identifier or error
public void scanAlg() throws Exception{
int counter = 0;
try{
BufferedReader br = new BufferedReader(new FileReader(this.file));
String line = new String();
Pattern constants = Pattern.compile("^-\\d+?|\\d+?|\\+\\d+?|'\\w'|\"\\w+?\"|\"\\s+?\"|''|' '$");
Pattern identifiers = Pattern.compile("^[a-zA-Z]+?|[a-zA-Z]\\d+?$");
Pattern costSpecial = Pattern.compile("^[1-9]\\d+?$");
String aux = "";
while((line = br.readLine())!= null){
counter++;
StringTokenizer tokenSplits = new StringTokenizer(line,"(),;=><[] ", true);
while(tokenSplits.hasMoreTokens()){
String token = tokenSplits.nextToken();
if(token.equals(" ")) continue;
if(reservedWords.contains(token) || sepList.contains(token) || operators.contains(token)){
classify(token, 0);
continue;
}
Matcher m = constants.matcher(token);
if(token.equals("-") | token.equals("+")){
aux = token;
continue;
}
Matcher s = costSpecial.matcher(token);
if(s.matches()){
String megaAux = aux.concat(token);
token = megaAux;
aux="";
}
if(m.matches()){
classify(token, 1);
continue;
}
Matcher t = identifiers.matcher(token);
int size = token.length();
if(t.matches() && size < 250){
classify(token,2);
continue;
}
throw new Exception("Error token: " + token + " on line " + counter);
}
}
br.close();
} catch (IOException e){
System.err.println(e.getMessage());
} catch (NumberFormatException e) {
System.err.println(e.getMessage());
} catch (NoSuchElementException e){
System.err.println(e.getMessage());
}
}
using System;
using System.Collections.Generic;
using System.ComponentModel;
using System.Data;
using System.Drawing;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using System.Windows.Forms;
namespace WindowsFormsApplication1
{
public partial class Form1 : Form
{
string plainTxt, key;
StringBuilder encrText = new StringBuilder();
StringBuilder decrText = new StringBuilder();
public Form1()
{
InitializeComponent();
}
public String decryption()
{
plainTxt = plainText.Text.ToUpper();
key = keyText.Text;
int ksize = key.Length;
int msize = plainTxt.Length;
char[] txt = plainTxt.ToCharArray();
for (int i = 0; i < msize; i++)
{
char decr = txt[i] - getShift(key, i) < 65 ? (char)((txt[i] - getShift(key, i)) + 27) : (char)((txt[i] - getShift(key, i)) - 1);
decrText.Append(decr);
}
return decrText.ToString();
}
public String encryption()
{
plainTxt = plainText.Text.ToUpper();
key = keyText.Text.ToUpper();
int ksize = key.Length;
int msize = plainTxt.Length;
if (ksize > msize) { return "Key size must be smaller than plaintext size"; }
char[] txt = plainTxt.ToCharArray();
for (int i = 0; i < msize; i++)
{
char encr = txt[i] + getShift(key, i) > 90 ? (char)((txt[i]+ getShift(key,i))- 26) : (char)((txt[i] + getShift(key, i))+1);
encrText.Append(encr);
}
return encrText.ToString();
}
private int getShift(string key, int i)
{
char[] k = key.ToCharArray();
int temp = i%key.Length;
return ((int)key[temp]) - 65;
}
private void encrButton_Click(object sender, EventArgs e)
{
String encrypted = encryption();
resultBox.Clear();
resultBox.AppendText(encrypted);
}
private void decrButton_Click(object sender, EventArgs e)
{
String decrypted = decryption();
resultBox.Clear();
resultBox.AppendText(decrypted);
}
}
}
using System;
using System.Collections.Generic;
using System.ComponentModel;
using System.Data;
using System.Drawing;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using System.Windows.Forms;
namespace BelasoCipher2
{
public partial class Form1 : Form
{
string alpha = " ABCDEFGHIJKLMNOPQRSTUVWXYZ";
string plainTxt, cdkey;
public Form1()
{
InitializeComponent();
}
//Return integer values to plaintext
public String convertS(List<int> intCrypt)
{
int size = intCrypt.Count;
StringBuilder rez= new StringBuilder();
for (int i = 0; i < size; i++)
{
for (int j = 0; j < 27; j++)
{
if (intCrypt[i] == j) //if integer value = position add letter to string
rez.Append(alpha[j]);
}
}
return rez.ToString();
}
//Modulo function for Z classes
private int mod(int x, int m)
{
int r = x % m;
return r < 0 ? r + m : r;
}
//Encryption/decryption algorithm based on integer values of alphabet/key/plaintext
private string decriEncryAlg(int n){
plainTxt = ptextBox.Text.ToUpper();
cdkey = keyBox.Text.ToUpper();
int size = plainTxt.Length;
String result;
List<int> kLi = new List<int>();
List<int> pLi = new List<int>();
List<int> resList = new List<int>();
int klen = cdkey.Length;
if (klen > size) { return "Key size must be smaller than plaintext size"; }
kLi = keyCode(cdkey); // get integer position value in the alphabet of key
pLi = divideString(plainTxt, klen); //get integer position value in the alphabet of plaintext
int pLiSize = pLi.Count;
int temp = 0;
int index = 0;
while (temp <= pLiSize) // going on chunks of key size up to integer value of plaintext list size
{
for (int i = 0; i < klen; i++)
{
if (index >= pLiSize) //If index >= size then return the result of encr/decr
{
result = convertS(resList);
return result;
}
int tempAux;
if(n == 0) tempAux = pLi[index]+kLi[i]; //if 0 then encryption
else tempAux = pLi[index]-kLi[i]; //else decryption
resList.Add(mod(tempAux, 27));
index++;
}
temp += klen;
}
result = convertS(resList);
return result;
}
public string decryption()
{
string result = decriEncryAlg(1);
return result;
}
public string encryption()
{
string result = decriEncryAlg(0);
return result;
}
//Get integer values according to alphabet of key word
public List<int> keyCode(string key)
{
List<int> list = new List<int>();
int len = key.Length;
for (int i = 0; i < len; i++)
{
for (int j = 0; j < 27; j++)
{
if (key[i].Equals(alpha[j])) list.Add(j);
}
}
return list;
}
//Divide plaintext in chunks <=the size of key word and get their integer value from the alphabet
public List<int> divideString(string s, int k)
{
List<int> list = new List<int>();
int size = plainTxt.Length;
int temp = 0, ke=k;
StringBuilder aux = new StringBuilder();
do
{
for (int z = temp; z < ke; z++)
{
if (z >= size) break;
aux.Append(plainTxt[z]);
}
for (int i = temp; i < ke; i++)
{
if (i >= size) return list;
for (int j = 0; j < 27; j++)
{
if (aux[i].Equals(alpha[j])) list.Add(j);
}
}
temp = temp + k;
ke += ke;
} while (temp <= size+k);
return list;
}
private void encButton_Click(object sender, EventArgs e)
{
String encrypted = encryption();
textBox3.Clear();
textBox3.AppendText(encrypted);
}
private void decrButton_Click(object sender, EventArgs e)
{
String decrypted = decryption();
textBox3.Clear();
textBox3.AppendText(decrypted);
}
}
}
