The Gateway to Computer Science Excellence

For all GATE CSE Questions

- Facebook Login
- or
- - Email or Username
  - Password
  - Remember
  - Register | I forgot my password

Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams

Recursive problem [closed]

0 votes

28 views

closed as a duplicate of: GATE2014-1-35

asked Jul 22, 2018 in Compiler Design by Deepalitrapti Junior (867 points)
closed Jul 22, 2018 by Arjun | 28 views

0

is it C?

commented Jul 22, 2018 by MiNiPanda Boss (23.5k points)

Please log in or register to add a comment.

0 Answers

← Prev. Qn. in Sub. Next Qn. in Sub. →

← Prev. Next →

Related questions

0 votes

2 answers

1

Halting problem of TM which recognize recursive languages is undecidable?
Halting problem of Turing machines which recognize recursive languages is undecidable. (True / False)

asked Dec 10, 2018 in Theory of Computation by gmrishikumar Active (2.1k points) | 209 views

decidability
recursive-and-recursively-enumerable-languages
theory-of-computation
turing-machine
rice-theorem

+1 vote

2 answers

2

Write C Program using Recursive Funtions for the Problem Described below and Analyse the Complexity Of the Code

asked Dec 21, 2016 in Programming by Anjana Babu Active (1k points) | 169 views

programming-in-c
algorithms
functions
time-complexity

0 votes

0 answers

3

Recursive Descent Parser
Does RDP require back tracking ? I am asking this because I have read that if RDP doesn't require back tracking then it is a predictive parser(LL(1))!! A predictive parser is a recursive descent parser that does not require backtracking. ... the class of LL(k) grammars ( https://en.wikipedia.org/wiki/Recursive_descent_parser ) Does it mean that the RDP requires BT

asked Jan 24, 2019 in Compiler Design by Nandkishor3939 Active (1.3k points) | 66 views

compiler-design
parsing

+1 vote

0 answers

4

Non-Left recursive grammar of the below grammar.
Grammar. S → Aa | B A → Ac | Aad | bd | epsilon . .

asked Jan 2, 2019 in Compiler Design by susgir2 Active (1.5k points) | 95 views

compiler-design
left-recursion
grammar
parsing
recurrence

Quick search syntax

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Recent Posts

ISRO CSE 2020 PAPER ANALYSE
BARC OCES/DGFS 2020
ISI CMI PDF by GATE Overflow
Calculus Important Points
Management Trainee Recruitment COAL INDIA 2020

All categories
General Aptitude 1.9k
Engineering Mathematics 7.5k
Digital Logic 2.9k
Programming and DS 4.9k
Algorithms 4.4k
Theory of Computation 6.2k
Compiler Design 2.1k
Operating System 4.5k
Databases 4.1k
CO and Architecture 3.4k
Computer Networks 4.2k
Non GATE 1.4k
Others 1.4k
Admissions 595
Exam Queries 573
Tier 1 Placement Questions 23
Job Queries 72
Projects 18

Follow @csegate

Recent Blog Comments

It is mentioned "Left for Evaluation" so no...
I think this discussion will keep on going till...
do we have to include marks of qs that are left...
@roh6jmon yes, it is there.
Click on the computer science link .In the opened...

Lightbox

50,737 questions

57,316 answers

198,360 comments

105,087 users

Send feedback
My Marks
College Prediction
Useful Links
FAQ
Corrections
Discuss
Copyright
Request
Testimonials
Chat Logs
Chat
Badges
Search tips
Exam Category
Blog Category
Blog Tags
Privacy

Donut Theme with by Amiya Sahu

Powered by Question2Answer

GATE Overflow