diaabaraka/Lexical-Analyzer diaabaraka/Lexical-Analyzer

  • Stars
    star
    1
  • Language
    C++
  • Created over 9 years ago
  • Updated over 9 years ago
Twitter logo Share LinkedIn logo Share Facebook logo Share
diaabaraka/Lexical-Analyzer
github

diaabaraka

Reviews

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

Repository Details

The lexical analyzer generator is required to automatically construct a lexical analyzer from a regular expression description of a set of tokens. The tool is required to construct a nondeterministic finite automata (NFA) for the given regular expressions, combine these NFAs together with a new starting state, convert the resulting NFA to a DFA, minimize it and emit the transition table for the reduced DFA together with a lexical analyzer program that simulates the resulting DFA machine.

More Repositories

1

Fishdom

A simulation game of the ocean, fishes, and sharks
C++
1
star
2

DistributedShortestPath

In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized. This is a fundamental and well-studied combinatorial optimization problem with many practical uses: from GPS navigation to routing schemes in computer networks; search engines apply solutions to this problem on website interconnectivity graphs and social networks apply them on graphs of peoples' relationships. In this project, the task is to answer shortest path queries on a changing graph, as quickly as possible. We will provide an initial graph which you may process and index in any way you find necessary. Once this is done, we will begin issuing a workload consisting of a series of sequential operation batches. Each operation is either a graph modification (insertion or removal) or a query about the shortest path between two nodes in the graph. Your program is expected to correctly answer all queries as if all operations had beenexecuted in the order they were given. The graphs are directed and unweighted. Input to your program will be provided via standard input, and the output must appear on the standard output.
Java
1
star