Skip to content

  • Projects
  • Groups
  • Snippets
  • Help
    • Loading...
    • Help
    • Submit feedback
    • Contribute to GitLab
  • Sign in
A
Algorithms Library Toolkit Core
  • Project
    • Project
    • Details
    • Activity
    • Releases
    • Cycle Analytics
  • Repository
    • Repository
    • Files
    • Commits
    • Branches
    • Tags
    • Contributors
    • Graph
    • Compare
    • Charts
  • Issues 43
    • Issues 43
    • List
    • Board
    • Labels
    • Milestones
  • Merge Requests 0
    • Merge Requests 0
  • CI / CD
    • CI / CD
    • Pipelines
    • Jobs
    • Schedules
    • Charts
  • Registry
    • Registry
  • Wiki
    • Wiki
  • Snippets
    • Snippets
  • Members
    • Members
  • Collapse sidebar
  • Activity
  • Graph
  • Charts
  • Create a new issue
  • Jobs
  • Commits
  • Issue Boards
  • Algorithms Library Toolkit
  • Algorithms Library Toolkit Core
  • Issues
  • #207

Closed
Open
Opened Nov 23, 2020 by Tomáš Pecka@peckato1
  • Report abuse
  • New issue
Report abuse New issue

ToCNF

ToCNF algorithm seems to handle the removal of epsilon-rules and unit-rules from the grammar, when the input is CFG or EpsilonFreeCFG.

Should this algorithm even perform this? I think we should consider checking for valid grammar structure and then either throw an exception or convert to CNF. Do not invoke both (see for example AutomatonComplement and Total).

Edited Feb 21, 2021 by Tomáš Pecka
Assignee
Assign to
None
Milestone
None
Assign milestone
Time tracking
None
Due date
No due date
0
Labels
None
Assign labels
  • View project labels
Reference: algorithms-library-toolkit/automata-library#207