C++CompletedIntense Violet theme

Regex → NFA → DFA

An educational C++ project exploring the formal-language pipeline between regular expressions, finite automata and related conversions or parsing techniques.

C++Automata
RNRegex → NFA → DFA
C++Main technology
18Tracked files*
5.cpp files
5.h files

*File metrics count tracked files after excluding common generated build folders. The project status is an editable draft classification.

01 · What it does

What the application does

Capabilities evidenced by project documentation and source structure; some behaviours require platform configuration.

01

Regular-expression parsing and transformations.

Regular-expression parsing and transformations.

02

NFA/DFA modelling and conversion exercises.

NFA/DFA modelling and conversion exercises.

03

C++ data structures for formal languages.

C++ data structures for formal languages.

02 · Technical structure

How the system works

Technical architecture drawn from the repository and supplied documentation.

01

The project uses C++, Automata as its documented technical foundation.

02

The source tree and supplied README describe the primary modules; individual files and runtime behaviour may vary by platform.

04 · Source and design

Implementation examples and code walkthrough

Regular-expression conversion uses explicit operator precedence

LFC Grammar_NFA_DFA_Regex_Regular_Expression/LFC Project 2/PostfixConverter.cppVerified GitHub source excerpt (abridged)
std::string PostfixConverter::ConvertToPostfix(const std::string& regex) {
    std::string augmented_regex = AddConcatenation(regex);
    std::string postfix;
    std::stack<char> operators;
    std::unordered_map<char, int> precedence = {
        {'*', 3}, {'.', 2}, {'|', 1}, {'(', 0}
    };
    int balance = 0;
    // The parser then validates parentheses and operators.
    // Refer to the source file for the complete implementation.
}

Finite automaton transitions

C++

DFA transitions maintain the transition list, state set and recognized alphabet.

LFC Grammar_NFA_DFA_Regex_Regular_Expression/LFC Project 2/AFD.cppSelected source excerpt
void AFD::AddTransition(int from, int to, const std::string& symbol)
{
    transitions.push_back({ from, to, symbol });
    states.insert(from);
    states.insert(to);
    alphabet.insert(symbol);
}
06 · Technology

Programming languages & stack

C++
Automata

Technology overview: C++, Automata. The list reflects documented tools, dependencies and proposed components; for planned projects it does not prove implementation.

File types identified: 5 .cpp, 5 .h, 3 .txt

07 · Reality check

Status, evidence & limitations

The project status is based on repository sources and supplied documentation. It may be updated as the project evolves. A published case study is not a certification of production readiness.
  • Features are based on the supplied README and code inventory; no end-to-end runtime certification is implied.
08 · Resources

Project resources

Explore the public repository, source code and project documentation on GitHub.