Top "Grammar" questions

A formal grammar is a set of production rules that describe how to form strings of valid syntax.

How to solve a shift/reduce conflict?

I'm using CUP to create a parser that I need for my thesis. I have a shift/reduce conflict in …

grammar lalr shift-reduce-conflict
Efficient Context-Free Grammar parser, preferably Python-friendly

I am in need of parsing a small subset of English for one of my project, described as a context-free …

python parsing nlp grammar nltk
How to define a grammar for a programming language

How to define a grammar (context-free) for a new programming language (imperative programming language) that you want to design from …

compiler-construction programming-languages grammar context-free-grammar
Converting grammar to Chomsky Normal Form?

Convert the grammar below into Chomsky Normal Form. Give all the intermediate steps. S -> AB | aB A -&…

grammar context-free-grammar chomsky-normal-form
"Sign In" or "Log in" or "Login"

Possible Duplicate: UI Terminology: Logon vs Login Which is the right one to use - Sign in - Log in …

authentication grammar
How to implement Backus-Naur Form in Python

I know there are some vaguely similar questions already relating to BNF (Backus-Naur Form) grammars in Python, but none of …

python parsing grammar bnf
Regex BNF Grammar

Is there any BNF grammar for regular expression?

regex grammar bnf
Is there a standard C++ grammar?

Does the standard specify the official C++ grammar? I searched, but did not find it anywhere. Also, I wish to …

c++ standards grammar context-free-grammar chomsky-hierarchy
Algorithm for computing FIRST and FOLLOW sets for context-free grammars

I need an algorithm to computing FIRST and FOLLOW sets for a grammar. Is there a simple algorithm or simple …

parsing compiler-construction grammar ll
Regular expression to match string of 0's and 1's without '011' substring

I'm working on a problem (from Introduction to Automata Theory, Languages and Computer by Hopcroft, Motwani and Ullman) to write …

regex compiler-construction grammar automata