Skip to content

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.

Notifications You must be signed in to change notification settings

TashikMoin/CFG_Parser

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

40 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Implementation Of A Context Free Grammar

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

No packages published

Contributors 4

  •  
  •  
  •  
  •