akuya11 Goto Github PK

akuya11.github.io

hexo blog

compiler

LL(1) table

dfa2regex

gramma_analysis

LL(1) and LR

grammar

A simple grammar structure which constructs the FIRST, FOLLOW, and LR(0) sets

iris-classification

Iris Classification using PCA

iris-flower-dataset

classifying iris flowers(Iris setosa, Iris versicolor and Iris virginica) from the given dataset iris.csv using famous instance based machine learning algorithm KNN.

knn

An implementation of the K Nearest Neighbors Algorithm from scratch in python (using the Iris dataset)

knn-classifier

kNN classifier built in MATLAB.

lalr-parser

lalr1_parser

program illustrates how to construct an LALR(1) parser

lalr1c

LALR1C

lda

Linear Discriminant Analysis based on Matlab

lda-1

Linear discriminant analysis

ll-1-parser

LL(1) Parser for any valid grammar made in C++

ll-1-parsing-table

The following repo contains a C code which takes a regular grammar as input and generates the FirstPos , and FollowPos of the non - Terminals and Displays its corresponding LL(1) Parsing Table. Then using that table and an input string it simulates the LL(1) parsing action.

ll1-judge

判断LL（1）文法和转换

ll1-parser

my lame LL1-parser

lr-0--parser

This is a simple implementation of an LR(0) Parser. (using C)

pattern-recognition

LDA, KNN, GA, K-means on Iris, Sonar and USPS datasets.

patternrecognition_matlab

Feature reduction projections and classifier models are learned by training dataset and applied to classify testing dataset. A few approaches of feature reduction have been compared in this paper: principle component analysis (PCA), linear discriminant analysis (LDA) and their kernel methods (KPCA,KLDA). Correspondingly, a few approaches of classification algorithm are implemented: Support Vector Machine (SVM), Gaussian Quadratic Maximum Likelihood and K-nearest neighbors (KNN) and Gaussian Mixture Model(GMM).

recursive_descent_parser_for_ll1_grammar

The project consists of generating the algorithm based on an input grammar. The program written in the generated file is a valid one, which can be verified by executing it and testing if different strings are built using the initial grammar.

regex2dfa

Convert a simple regular expression to a DFA