-
Notifications
You must be signed in to change notification settings - Fork 2
A context-free grammar is a set of recursive rules used to generate patterns of strings. Context-free grammar can describe all regular languages and more, but it cannot describe all possible languages. I used C++ to check whether the given structure/sentence(input) satisfies the given grammar or not.
TashikMoin/CFG_Parser
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
A context-free grammar is a set of recursive rules used to generate patterns of strings. Context-free grammar can describe all regular languages and more, but it cannot describe all possible languages. I used C++ to check whether the given structure/sentence(input) satisfies the given grammar or not.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published