Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by AskHerOut
0
votes
0
answers
1
#Instruction-pipeline Data hazard between two consecutive memory access instruction
Although the following instructions do not make much sense but if such case occurs, is data forwarding from MA of I1 to MA of I2 allowed? Or will it result in some stall? Please add some reference, I couldn't find any yet. I1: Load A //A<-Mem[address] I2: Store Adress2, A // Mem[Address2] <- A
Although the following instructions do not make much sense but if such case occurs, is data forwarding from MA of I1 to MA of I2 allowed? Or will it result in some stall?...
473
views
asked
Dec 22, 2017
CO and Architecture
co-and-architecture
pipelining
data-hazards
+
–
1
votes
2
answers
2
C. interesting scenario.
Can you see why the output of the following code is 256? main () { int a=0x1ff; char *careful= &a; *careful = 0; printf("%d", a); }
Can you see why the output of the following code is 256?main () { int a=0x1ff; char *careful= &a; *careful = 0; printf("%d", a); }
509
views
asked
Oct 24, 2017
Programming in C
programming
programming-in-c
output
+
–
3
votes
1
answer
3
DPDA: One Liners
1) Can a Deterministic PDA has two epsilon transition each reading different Stack symbol to perform a transition? 2) Can a transition be performed without reading Stack symbol at all. Like $ a, λ/ λ$?
1) Can a Deterministic PDA has two epsilon transition each reading different Stack symbol to perform a transition?2) Can a transition be performed without reading Stack s...
739
views
asked
Oct 22, 2017
Theory of Computation
theory-of-computation
pushdown-automata
dpda
+
–
3
votes
1
answer
4
LL Grammar: how does look ahead affect left recursion and left factoring
lets consider a grammar as: $A\rightarrow Ab | Ac | a$ while checking whether it belongs to LL(1) grammar, we would point out that it has a left recursion as well as left factoring. I was wondering that what ... symbol, A to decide the production rule to be applied. any further insights about the same will be very helpful.
lets consider a grammar as:$A\rightarrow Ab | Ac | a$while checking whether it belongs to LL(1) grammar, we would point out that it has a left recursion as well as left f...
1.7k
views
asked
Oct 1, 2017
Compiler Design
compiler-design
parsing
grammar
ll-parser
+
–
1
votes
1
answer
5
Pushdown Automata: acceptance of a string
In certain Pushdown Automata, will the input string considered accepted if while reading it we reach to final state but 1) the stack in not empty and contain few symbols? AND/OR 2) there is still some remaining part of the string to be read(on processing which we might end up on some non-final state again). An elaborate answer will be highly appreciated.
In certain Pushdown Automata, will the input string considered accepted if while reading it we reach to final state but1) the stack in not empty and contain few symbols?A...
839
views
asked
Oct 1, 2017
Theory of Computation
theory-of-computation
pushdown-automata
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register