to customize your list.
more stack exchange communities
Start here for a quick overview of the site
Detailed answers to any questions you might have
Discuss the workings and policies of this site
tag has no wiki summary.
Steps in converting a grammar to LL(1) Grammar
I have the following question: Convert the following grammar into an LL(1) grammar which recognises the same language (you may assume that the grammar is unambiguous). A -> int A -> int + A A ...
Jan 4 '13 at 16:01
recently active ambiguity questions feed
unanswered question tagged
Hot Network Questions
An adjective or noun for someone who "has a lot of gall"?
Windows 10- turn off game notifications
"Muita pouca gente" or/ou "muito pouca gente"?
Solving 2 dimensional recurrence equation
What had I become?
Can I cut an IC?
Word for a given situation
Will Internet Explorer run on Windows 10
Do propeller planes give contrails like jets do?
64 bit ASCII weaving
Can we say "Finish your dish"
is there a word for the time span between an old king and a new king?
Make the Mexican Wave
How do you answer "Oh, you're a professor? What do you teach?"
Greatest of the numbers given
Put a dot above a bold symbol in an equation?
What is the terminology for tricking the user into thinking they've almost won big?
Recursive function to show directions for multiple locations
Is my use of "naive" correct?
Whiskey in US movies out of plain glass decanters. A movie or culture thing?
Is the use of a QR code worth the space it requires?
Why do we have "another" definition for the kernel?
British Airways airport desk & dual nationality
Why does 1366x768 resolution exist?
more hot questions
Life / Arts
Culture / Recreation
TeX - LaTeX
Unix & Linux
Ask Different (Apple)
Geographic Information Systems
Science Fiction & Fantasy
Seasoned Advice (cooking)
Personal Finance & Money
English Language & Usage
Mi Yodeya (Judaism)
Cross Validated (stats)
Theoretical Computer Science
Meta Stack Exchange
Stack Overflow Careers
site design / logo © 2015 Stack Exchange Inc; user contributions licensed under
cc by-sa 3.0