Test
test1 4
Crea una cuenta gratis para terminar este test
Guarda tu progreso y consulta tu resultado final.
¿Ya tienes cuenta? Inicia sesión
Preguntas del test (11)
1What constitutes the stages of the compilation process?
- AFeasability study, system, design, and testing
- BImplementation and documentation
- CLexical analysis,syntax, Analysis and code generation
- DNone of the mentioned
2The lexical analyzer takes ________ as input and produces a stream of __________ as output
- ASource program, tokens
- BToken, source programs,
- CEither of the two
- DNone of the mentioned
3The scanner generator takes _________ as input and produces _________ as output.
- AToken, scanner
- BRegular expressions, tokens
- CRegular expressions, scanner
- DLexeme, scanner
4Which of the following is not a feature of compiler?
- AScan the entire program first and translate into machine code
- BTo remove syntax errors
- CSlow for debugging
- DExecution time is more
5A programmer, by mistake writes a program to multiply two numbers instead of dividing them, how can this error be detected?
- ACompiler
- BInterpreter
- CCompiler or intepreter
- DNone of the mentioned
6Which of the following pairs of regular expressions are equivalent?
- A1(01)* and (10)*1
- Bx(xx)* and (xx)*x
- Cx+ and x+x*
- DAll of the mentioned
7The language of regular expression (x | y)(x | y) is the set _________
- A{xy, xy}
- B{xx, xy, yx, yy}
- C{x, y}
- D{x, y, xy}
8The language of the regular expression x | y is the set
- A{x, y}
- B{xy}
- C{x}
- D{y}
9An NFA's transition function returns
- AA boolean value
- BA state
- CA set of states
- DAn edge
10Can a DFA simulate NDFA?
- ANo
- BYes
- CSometimes
- DDepends on NDFA
11The relation between NFA-accepted languages and DFA accepted languages is
- A>
- B<
- C=
- D<=
Información
- Descripción
- Test sobre test1 4, creado por Austin Stockhecke el 01/10/2018.
- Autor
- Austin Stockhecke
- Idioma
- English
- Visitas
- 1
- Valoración
- Aún sin valoraciones Valora este test