QUESTIONS FOR THE CONFERENCE ON COMPILERS
April 13, 2010 — iiJIRI KOUTNY:
Mr. Jiri Koutny is a Ph. D Student in the Department of Information System at Fit But. In 2008, he got a Master of Science at Fit But on Computer Graphics and Multimedia.
From 2007 to 2008, he has been doing some Technical Literature Translations and among his publications we can find the articles: “On n-Path- Controlled Grammars” (2010) or “Regular Paths in Derivations Trees of Context- free Grammars” (2009).
He is also taking part in a project on “Recognition and Presentation of Multimedia Data”
His areas of research interest are:
formal language, automata and grammar
regulated models, grammars with restricted derivation trees
application of theoretical computer science in computer graphics
MARTIN CERMAK
Mr. Martin Cermak is a Ph. D Student in the Department of Information System at Fit But. In 2008 he got a Master of Science on Intelligent Systems. From 2006 to 2009, he has been working as a developer for Duha System and INexia. Among his publications we can find the articles: “Multilanguages and Multiaccepting Automata System” (2010), “Power Decreasing Derivation Restriction in Grammar Systems” (2009) and “System of Formal Models and Their Application” (2008).
He is also taking part in a project on “Recognition and Presentation of Multimedia Data”
His areas of research interests are:
Formal languages, grammars, automata
Compilators
Therory of program languages
CONFERENCE ON FORMAL LANGUAGE, COMPILERS AND TURING MACHINES
April 13, 2010 — iiABSTRACT:
Our research activities are mainly from the area of formal languages (grammars, automata, grammar systems, ...). Our topics are: Jiri Koutny - Introduction to Formal Languages (teaching) - Introduction to Compilers, Structure of Compiler (teaching) - Parsing (teaching) - Grammars with Restricted Derivation Trees (research) - TC grammars, PC grammars, CC grammars (research) Martin Cermak - Introduction to automata theory (teaching) - Lexical analysis (teaching) - Generators and optimization (teaching) - Power-decreasing restriction on grammar systems (research) - Introduction to multi-grammars and automata systems (research)Jiri Koutny http://www.fit.vutbr.cz/~ikoutny/ Martin Cermak http://www.fit.vutbr.cz/~icermak/
FORMAL LANGUAGE: Formal languages are often used as the basis for richer constructs endowed with semantics. In computer science they are used, among other things, for the precise definition of data formats and the syntax of programming languages (http://en.wikipedia.org/wiki/Formal_language)COMPILERS: A compiler-compiler or compiler generator is a tool that creates a parser, interpreter, or compiler from some form of formal description. The earliest and still most common form of compiler-compiler is a parser generator, whose input is a grammar (usually in BNF) of a programming language, and whose generated output is the source code of a parser. ( http://en.wikipedia.org/wiki/Compiler_compiler)
TURING MACHINES: A Turing machine is a theoretical device that manipulates symbols contained on a strip of tape. Despite its simplicity, a Turing machine can be adapted to simulate the logic of any computer algorithm, and is particularly useful in explaining the functions of a CPU inside of a computer. The “Turing” machine was described by Alan Turing in 1937,[1] who called it an “a(utomatic)-machine”. (http://en.wikipedia.org/wiki/Turing_machines )
UNIT 2: THE INTERNET. VOCABULARY
April 13, 2010 — iiAn internetwork or the internet: different networks connected together.The connection of networks thorought the world is called the Internet.
Routers: networks connected all over the world to the internet using electronic devices.
ISP (Internet Service Provider): provides users with an Internet connection.
Email: electronic mail
Mailboxes: storage areas to keep electronic messages
Newsgroups: groups of users that have a common interest can suscribe to these
UFO: unidentified flying object
TASK: WRITE AN APPLICATION FORM
March 30, 2010 — iiNewspaper: The Times
Date: The 29th of March
Job: Computing Engineer working for IBM (Lotus Division)
Knowledge required: a degree in Computing Engineering and a good command of English language
Send your application forms to:
IBM (Lotus Division)
5 Charing Croos Street
New York
GRAMMAR: PRESENT PERFECT AND PAST SIMPLE
March 30, 2010 — iiSimple Past: action which is already finished
Present Perfect: when there is a connection between the past and
the present
Examples:
– He left quite early but he hasn´t arrived yet
– We haven´t seen each other since we left school
– Have you ever written a poem?
– She has never been to Istanbul
– I lent him 50 euros last week, but he hasn´t paid me yet
– I don´t see them often but I´ve known them for ten years ( I ´ve
been knowing them since 1990- Since + Present Perfect
Continuous / Present Perfect)
– What year did you leave school?
– We´re lost. We have already been down this road twice
– I sent her an e-mail last week, but she hasn´t replied yet
– They have lived in that house since 1980 (They havc been living )
– How long have you been at university? (in the university)
– I started two years ago
– I lived with them for the first two years but then I moved into a
student hostel last September and I have lived there since then
– Has your brother found a job yet?
– Yes, he has just started work in a hotel
– Have you ever been to Nobu- that new Japanese Restaurant?
– Yes, we went there for my birthday
– the food was fantastic but it cost a fortune
UNIT 2. EXAMPLE OF AN APPLICATION LETTER
March 29, 2010 — iiAn application letter:
Application letters are usually just one page and consist of three sections:
-
Front matter. State that you are applying for a specific job title or field. Also mention the person who referred you or told you about the job. If you learned of the job from an advertisement, mention that.
Example: “With reference to your advertisement published in “The Times” on the 29th of March, I would like to apply for the post of Computing Engineer”
-
Body. Explain specifically why you are qualified for the job. Describe education and work experience and any other activities that display relevant talents, such as foreign-language proficiencies and leadership or supervisory experience.
“I enclose the name of three referees who can testify to my conduct and career”
XYZ Company
87 Delaware Road
Hatfield, CA 08065
Date
Dear Mr. Gilhooley,
I am writing to apply for the programmer position advertised in the Times Union. As requested, I am enclosing a completed job application, my certification, my resume and three references.
The opportunity presented in this listing is very interesting, and I believe that my strong technical experience and education will make me a very competitive candidate for this position. The key strengths that I possess for success in this position include:
- I have successfully designed, developed, and supported live use applications
- I strive for continued excellence
- I provide exceptional contributions to customer service for all customers
With a BS degree in Computer Programming, I have a full understanding of the full life cycle of a software development project. I also have experience in learning and excelling at new technologies as needed.
Please see my resume for additional information on my experience.
I can be reached anytime via email at george.gillhooley@email.com or my cell phone, 909-555-5555.
Thank you for your time and consideration. I look forward to speaking with you about this employment opportunity.
Sincerely,
FirstName LastName
LETTER OF COMPLAINT
March 22, 2010 — iiWrite a letter of complaint:
Alses S.L.
5 Chester Road
Manchester
You are an engineer who has called for the third time in the past ten days to ALSES (computing company) to repair your machine, but you are still waiting for an answer and your computer doesn´t work at all.
The spider 
You must be logged in to post a comment.