Skip to main content
Glama

Server Configuration

Describes the environment variables required to run the server.

NameRequiredDescriptionDefault

No arguments

Instructions

Guidance the server publishes about itself, which clients place ahead of the tool catalog so the model reads it before choosing anything.

This server publishes no instructions, or was last inspected before Glama recorded them.

Capabilities

Features and capabilities supported by this server

Protocol revision2025-11-25

CapabilityDetails
tools
{}

Tools

Functions exposed to the LLM to take actions

NameDescription
jflap_inspectB

Inspect a JFLAP 7.1 (.jff) file. Returns structure metadata, states, initial/final states, transitions, determinism, or grammar productions.

jflap_simulateA

Simulate one or more input strings on a JFLAP automaton (DFA, NFA, PDA, Turing Machine, Mealy, Moore). Returns accept/reject verdicts and output strings/final tapes. For PDAs, acceptance mode can be explicitly set to 'final_state' or 'empty_stack'.

jflap_simulate_batchA

High-performance batch simulation of hundreds or thousands of input strings on an automaton in a single call. Returns verdicts[] array.

jflap_traceB

Execute a step-by-step configuration trace of an input string on an automaton. Returns the exact trace of states, remaining input, stack contents (for PDA), or tape contents (for Turing machine). For PDAs, acceptance mode can be explicitly set to 'final_state' or 'empty_stack'.

jflap_fsa_operationB

Perform Finite State Automata transformations: convert NFA to DFA ('nfa_to_dfa'), minimize a DFA ('minimize'), verify language equivalence between two FSAs ('equals'), or combine two automata into one ('combine').

jflap_grammar_operationA

Execute grammar operations in JFLAP: parse a string ('parse') using CYK or Brute-force parser, remove lambda, unit, and useless productions ('clean'), or compute FIRST and FOLLOW sets and test LL(1) parseability ('first_follow').

jflap_convert_modelB

Perform cross-formalism conversion: FSA to Regular Expression ('fsa_to_re'), FSA to Regular Grammar ('fsa_to_rg'), Regular Grammar to FSA ('rg_to_fsa'), CFG to PDA ('cfg_to_pda'), or PDA to CFG ('pda_to_cfg').

jflap_lsystem_expandC

Expand an L-System (Lindenmayer system) to a given recursion depth/level.

jflap_create_modelA

Programmatically generate a new JFLAP .jff file from a JSON model specification (Finite Automaton, PDA, Turing Machine, or Grammar).

jflap_export_dotC

Export an automaton to Graphviz DOT format for rendering diagrams.

jflap_export_tableA

Export a plain JSON transition table (states, alphabet, start_state, accepting_states, transitions) for a DFA/NFA model. Returns a structured error for models that cannot be represented as finite state automata.

jflap_equivalence_checkA

Verify language equivalence between two automata (modelA, modelB). Returns equivalent boolean, plus the shortest distinguishing string if they differ.

jflap_launch_guiB

Launch the interactive JFLAP 7.1 graphical user interface (Swing desktop window), optionally opening a .jff file.

Prompts

Interactive templates invoked by user choice

NameDescription

No prompts

Resources

Contextual data attached and managed by the client

NameDescription

No resources

TDQS

A3.6/5.0

Scored across 13 tools

Disambiguation4/5

Most tools map cleanly to distinct actions (inspect, create, simulate, trace, convert, export, launch GUI), and the single-vs-batch simulate pair is explicitly differentiated by scale. The main overlap is jflap_equivalence_check versus jflap_fsa_operation's 'equals' mode, which both verify language equivalence between automata.

Naming Consistency5/5

Every tool uses the same jflap_ prefix followed by a snake_case verb_noun pattern (jflap_inspect, jflap_create_model, jflap_export_dot). The naming is predictable and readable throughout.

Tool Count5/5

13 tools is well within a comfortable range for a domain with several automaton formalisms and operations. Each tool covers a meaningful capability (inspection, simulation, conversion, export, GUI launch) without redundancy bloat.

Completeness4/5

The surface covers the full lifecycle: create, inspect, simulate/trace, transform, convert between formalisms, export, and GUI launch. Minor gaps remain, such as editing/modifying an existing .jff model in place rather than only creating a new one.

Maintenance

ActivityMaintained
ResponsivenessNo recent community issues