LARA Sitemap This is a sitemap over all available pages ordered by namespaces. anonymous bapa biblio cc09 exercises_08 homework_06 homework_08 solutions about_parsing_context-free_grammars abstract_syntax_of_while accessing_and_storing_variables algorithm_for_first_and_follow_sets alternatives_to_compilation an_efficient_imperative_map applications_of_data-flow_analysis arm_architecture array_manipulation automata_for_lr_parsing_without_lookahead avoiding_left_recursion_in_recursive_descent basic_idea_of_first_symbol_computation booleans_and_data_representation branching_jvm_instructions building_ll_parsing_table charstream.scala checking_initialization_using_data-flow_analysis chomsky_normal_form collatz.while compilation_as_tree_transformation compiled_counting_examples compiled_expression_examples compiled_factorial_example compiler_construction_by_niklaus_wirth compiler_construction_tools compiler_interface_to_garbage_collector compilers_in_action compiling_conditional_expressions compiling_if_then_else compiling_statement_sequence compiling_while computing_follow_sets computing_labels computing_nullable_nonterminals concrete_syntax_of_while concrete_vs_abstract_syntax_trees constant_propagation control-flow_graph_definition control-flow_graph_to_assembly_with_global_variables course_information cyk_parsing_algorithm decomposing_complex_expressions describing_balanced_parantheses designing_correct_data-flow_analyses dispatched_procedures dragon_book earley_parser efficient_comparison_for_identifiers efficiently_emitting_code error_recovery_in_top-down_parser evaluating_postfix exam example_efficient_code_for_conditionals example_for_type_checking examples_for_initialization_analysis examples_of_lazy_evaluation exercices_04 exercises_01 exercises_02 exercises_03 exercises_04 exercises_05 exercises_06 exercises_08 final-report free_lists_by_size full_employment_theorem_for_compiler_writers functional_maps functional_versus_imperative_maps generational_garbage_collectors global_function_pointers grammar_of_formulas_in_cup hand-written_scanner_for_while_language higher-order_functions homework_01 homework_02 homework_03 homework_04 homework_05 homework_06 homework_07 homework_08 idea_of_data_flow_analysis idea_of_garbage_collection idea_of_type_rules identifiers_vs_symbols_example if_statements_to_cfg implementing_finite_state_machines incremenatal_garbage_collectors instruction_selection instruction_selection_using_tree_grammars interpreter.scala interpreting_cfg interpreting_ll_parsing_table isquares.while javacc jvm_instructions lab02-build.xml lab02-compiler.scala lab02-factorial.tool lab02-lexer.scala lab02-main.scala lab02-positional.scala lab02-reporter.scala lab02-tokens.scala lab03-compiler.scala lab03-parser.scala lab03-prettyprinter.scala lab03-trees.scala lab05-analyzer lab05-compilerstub lab05-symbols lab05-treeprinter lab05-trees lab06-compiler lab06-typechecker lab06-types lab08-codegen lab08-compiler lab08-main labs_01 labs_02 labs_03 labs_04 labs_05 labs_06 labs_07 labs_08 labs_09 labs_10 lambda_calculus languages_using_prefix_or_postfix_only lecture_01 lecture_02 lecture_03 lecture_04 lecture_05 lecture_06 lecture_07 lecture_08 lecture_09 lecture_10 lecture_11 lecture_12 lecture_13 lecture_14 lecture_15 left_factoring_recursive_descent lexer.scala lexerinterface.scala lexertest.scala limitations_of_regular_expressions linearizing_trees_with_control-flow live-variable_analysis ll_1_table-driven_parsing_overview ll_parser_uses_leftmost_derivation lr_0_parser_actions lr_1_parser_actions lr_parser_runs_automaton_over_stack lr_parser_uses_rightmost_derivation lr_parsing_tables lr_parsing_with_lookahead_items main.scala malloc_and_free mallocfree.scala mallocinfmem.scala mark_and_sweep_collector memory_fragmentation memory_layout_for_compiled_program method_calls mode_analysis modifying_parser_to_construct_ast motivation_for_lazy_evaluation non-determinism_and_underspecification notation_for_maps notion_of_hash-consing notion_of_semantic_action notion_of_subtyping object_and_reference_manipulation operational_semantics_of_lambda_with_letrec overview_of_classfile_constant_pool overview_of_compiling_to_stack_machine parsertrees.scala phases_of_a_compiler phi_functions_in_ssa_form pointer_reversal polynomials.pscala polytokens.jj polytokentest.java postfix_translation_of_boolean_operators precedence_in_lr_parsing prefix_infix_postfix_notation pretty_printing_ast primes.el printing_prefix_infix_postfix programs.scala prolog_examples proving_safety_properties_using_types pushdown_automata range_analysis_example recovering_expression_trees_from_ssa_form recursive_descent_for_polynomials recursive_descent_idea reference_counting register_allocation_using_liveness_information register_machine_model_in_scala reporting_errors_based_on_syntax_tree scaludita_examples scoping_rules_affect_program_meaning sets_of_states_at_each_program_point short-circuit_evaluation simple_copying_collector simple_implementations_of_lazy_evaluation simple_language_with_local_variables simple_nested_procedures simple_types_for_lambda_calculus slr_parser_actions source_and_target_cfg_vertices squares.while ssa_form_and_its_advantages stack_frames_and_procedure_calls strictness_analysis subtyping_for_assignments_and_soundness_idea subtyping_for_functions subtyping_with_assignments_and_generics symbol_table_contents test.jvm test.s testpolyinput.poly tiger_book tokens.scala tokens_words_of_while_language tool tool_compiler_project toolprog-binarysearch.tool toolprog-factorial.tool toolprog-maze.tool toolprog-pi.tool toolprog-quicksort.tool tools_for_constructing_lexers tooltypesystem top towards_a_systematic_approach_to_lexing transforming_to_chomsky_normal_form translating_basic_blocks_to_ssa_form translating_expressions_to_stack_machine translating_syntax_tree_to_cfg translation_correctness_for_expressions translation_of_relations treating_registers_as_stack tree.scala tree_tiling_of_xyz_example treesimplifier.scala type_checking_let_and_letrec type_rule_for_block_statement type_rules_for_statements_and_expressions type_rules_using_environment type_soundness_for_simply_typed_lambda_calculus types_expressing_program_properties using_finite_state_machines_for_lexical_analysis variable_capture vm_for_expressions what_is_a_compiler while_language while_language_parser while_statements_to_cfg whileparser.scala why_study_compilers why_study_lexical_analysis xyz_example_using_gcc cc10 cc11 cc12 cc13 cc14 cc15 cc16 cc17 cc18 cc19 cc20 ccost clp17 compilation cost-cert crystalball dpll encyc funprog17 funprog18 fv19 fv20 internal jahob lugano mikael_msc misc p parcon16 parcon17 parcon18 people phantm playground present projects reading sar10 sav08 sav08-old sav09 sav10 sav11 sav12 sav13 sav14 sav15 sav17 semantic smartfloat solutions surveys test tmp visitors wiki alin alloy_in_jahob bank_account_example_in_jahob bapa cartesianproducts cc cc09 cc11 cc12labs_04 ccost cfm chord_notes circuits cisy closure_properties_of_finite_state_machines clp codefromscala collaboration comfusy-examples comfusy complexity confdesk-notes confdesk conferences constraint_based_analysis_of_java_using_jahob_and_amrc context-free_grammars correctness_of_formula_propagation cost-cert cvc4-synthesis cvc4 data_structure_examples.html determinization_of_finite_state_machine dp eldarica encoding_lists_using_msol_over_strings epfl_internships equivalence_of_finite_state_machine_and_regular_expression_languages equivalence_relation exchanges_for_epfl_students expressing_finite_automata_in_msol_over_strings expressing_regular_expressions_in_msol_over_strings expressive_power_of_a_fragment_of_ws1s finite_state_machine finite_state_machine_with_epsilon_transitions fmcad fmcad11 fmcad11a fmcad2014 formal functionalsynthesis funding fv fvquimsical gallier_logic_book harrison_textbook horn-nonrec-benchmarks horn-parametric-benchmarks htmldoc impro inheritance insynth interfaces_for_atomicity interpreter introduction_to_using_msol_over_strings_to_verify_linked_lists isynth isynth_home jahob_system jahob_system_sets jniz3-scala-examples jniz3 kaplan lambda_calculus lara lara_posters laragit learning lecture16_transcript leon-repair-benchmarks leon-repair leon lisp_seminar_nlp_2008 master_s_program menu minimization_of_state_machines monadic_second-order_logic_over_trees monoid msol_over_strings nenofar news nicg non-converging_iteration_in_reals note_on_buffer_overflows note_on_substitutions notes_on_context-free_grammars ocaml_resources panagiotis_email parcon partial_order phantm phd_positions pmatching pong predicate_abstraction preorder printingposters programming_in_scala projects-old projects publications publications2 pushdown_systems randomized_model_finder rbound reachable_pushdown_configurations_are_regular regsy-examples regsy regular_expression regular_expressions_for_automata_with_parallel_inputs rosa sav sav07 sav07_future_lectures sav07_homework_1 sav07_homework_1_solution sav07_homework_2 sav07_homework_3 sav07_homework_4 sav07_homework_4_solution sav07_lecture_1 sav07_lecture_2 sav07_lecture_2_skeleton sav07_lecture_3 sav07_lecture_3_skeleton sav07_lecture_4 sav07_lecture_4_skeleton sav07_lecture_5 sav07_lecture_5_skeleton sav07_lecture_6 sav07_lecture_6_skeleton sav07_lecture_7 sav07_lecture_7_skeleton sav07_lecture_8 sav07_lecture_8_skeleton sav07_lecture_9 sav07_lecture_9_skeleton sav07_lecture_10 sav07_lecture_10_skeleton sav07_lecture_11 sav07_lecture_11_skeleton sav07_lecture_12 sav07_lecture_12_skeleton sav07_lecture_13 sav07_lecture_13_skeleton sav07_lecture_14_skeleton sav07_lecture_15 sav07_lecture_15_skeleton sav07_lecture_16 sav07_lecture_17 sav07_lecture_18 sav07_lecture_19 sav07_lecture_20 sav07_lecture_21 sav07_lecture_22 sav07_lecture_23 sav07_lecture_24 sav07_lecture_25 sav07_lecture_26 sav07_lecture_27 sav07_mini_projects sav07_project_ideas sav07_projects sav07_quiz_answers sav07_resource sav08 sav09 sav11 scalaz3 scp semantic semigroup simple_linked_list_operation_in_jahob sizedatatree.java sizelist.java slickchair slin smartfloat snisy software software_verification_tools_overview solver sortedlist.java start strings_and_languages stringsolver suri sverd svtp17 tarski_fixed_point_theorem teaching test test_draw test_folded test_latex threadedtree.java tips tree_automata treeinsertion.java useful using_automata_to_decide_msol_over_finite_strings using_automata_to_decide_presburger_arithmetic variable_range_analysis verifying_data_structures_using_jahob verifying_dijkstra_s_algorithm_in_jahob verifying_pattern_matching_with_guards visibly_pushdown_languages ws1s_expressive_power_and_quantifier_elimination