esa-kian/lexical-analyzer esa-kian/lexical-analyzer

  • Stars
    star
    1
  • Language
    C++
  • Created over 6 years ago
  • Updated almost 2 years ago
Twitter logo Share LinkedIn logo Share Facebook logo Share
esa-kian/lexical-analyzer
github

esa-kian

Reviews

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Repository Details

Lexical analysis is the first phase of a compiler. It takes the modified source code from language preprocessors that are written in the form of sentences. The lexical analyzer breaks these syntaxes into a series of tokens, by removing any whitespace or comments in the source code.

More Repositories

1

perspolis

JavaScript
3
star
2

otp-shinobi

This is an OTP authentication package for Golang
1
star
3

lemekar

PHP
1
star
4

ehsan-a-kian

1
star
5

trafficLights

TRAFFIC LIGHT WITH PROTEUS & CODEVISION SIMULATION
C
1
star
6

simpleInstagram

PHP
1
star
7

the-board-of-the-world

The Board of the World is a web application that users can write anything on it
Go
1
star
8

firebex

Firebex is an Iranian company that operates a cryptocurrency platform
JavaScript
1
star
9

ehsan-a-kian.github.io

JavaScript
1
star
10

simple_chat

simple chat room in php
PHP
1
star
11

pafi

Iranian Movie Database
PHP
1
star
12

quiz

PHP
1
star
13

algos

Implemented Algorithms using Python
PHP
1
star
14

marketplace

PHP
1
star
15

cinervice

PHP
1
star
16

algoGo

Here I implement and share algorithms and programming problems in Go language
Go
1
star
17

dataStructures

data structures and algorithms in c++
C++
1
star
18

apriori

Apriori is an algorithm for frequent item set mining and association rule learning over transactional databases. It proceeds by identifying the frequent individual items in the database and extending them to larger and larger item sets as long as those item sets appear sufficiently often in the database. The frequent item sets determined by Apriori can be used to determine association rules which highlight general trends in the database: this has applications in domains such as market basket analysis.
Python
1
star
19

british-council-grammar-pwa

LearnEnglish Grammar is a free grammar practice app designed to help improve English grammar accuracy. The app offers 1000s of questions to help practise and reinforce your English grammar skills.
1
star
20

8queens

The N Queen is the problem of placing N chess queens on an N×N chessboard so that no two queens attack each other. For example, following is a solution for 4 Queen problem. The expected output is a binary matrix which has 1s for the blocks where queens are placed.
Python
1
star
21

A_star

In computer science, A* (pronounced as "A star") is a computer algorithm that is widely used in pathfinding and graph traversal, which is the process of plotting an efficiently directed path between multiple points, called "nodes". It enjoys widespread use due to its performance and accuracy. However, in practical travel-routing systems, it is generally outperformed by algorithms which can pre-process the graph to attain better performance,[1] although other work has found A* to be superior to other approaches.[2] Peter Hart, Nils Nilsson and Bertram Raphael of Stanford Research Institute (now SRI International) first published the algorithm in 1968.[3] It is an extension of Edsger Dijkstra's 1959 algorithm. A* achieves better performance by using heuristics to guide its search.
Python
1
star
22

greedy

A greedy algorithm is an algorithmic paradigm that follows the problem solving heuristic of making the locally optimal choice at each stage[1] with the intent of finding a global optimum. In many problems, a greedy strategy does not usually produce an optimal solution, but nonetheless a greedy heuristic may yield locally optimal solutions that approximate a globally optimal solution in a reasonable amount of time. For example, a greedy strategy for the traveling salesman problem (which is of a high computational complexity) is the following heuristic: "At each step of the journey, visit the nearest unvisited city." This heuristic doesn't intend to find a best solution, but it terminates in a reasonable number of steps; finding an optimal solution to such a complex problem typically requires unreasonably many steps. In mathematical optimization, greedy algorithms solve combinatorial problems having the properties of matroids.
Python
1
star