°£Æí°áÁ¦, ½Å¿ëÄ«µå û±¸ÇÒÀÎ
ÀÎÅÍÆÄÅ© ·Ôµ¥Ä«µå 5% (175,750¿ø)
(ÃÖ´ëÇÒÀÎ 10¸¸¿ø / Àü¿ù½ÇÀû 40¸¸¿ø)
ºÏÇǴϾð ·Ôµ¥Ä«µå 30% (155,000¿ø)
(ÃÖ´ëÇÒÀÎ 3¸¸¿ø / 3¸¸¿ø ÀÌ»ó °áÁ¦)
NH¼îÇÎ&ÀÎÅÍÆÄÅ©Ä«µå 20% (148,000¿ø)
(ÃÖ´ëÇÒÀÎ 4¸¸¿ø / 2¸¸¿ø ÀÌ»ó °áÁ¦)
Close

Programming Languages And Methodologies

¼Òµæ°øÁ¦

2013³â 9¿ù 9ÀÏ ÀÌÈÄ ´©Àû¼öÄ¡ÀÔ´Ï´Ù.

°øÀ¯Çϱâ
Á¤°¡

194,740¿ø

  • 185,000¿ø (5%ÇÒÀÎ)

    5,550P (3%Àû¸³)

ÇÒÀÎÇýÅÃ
Àû¸³ÇýÅÃ
  • S-Point Àû¸³Àº ¸¶ÀÌÆäÀÌÁö¿¡¼­ Á÷Á¢ ±¸¸ÅÈ®Á¤ÇϽŠ°æ¿ì¸¸ Àû¸³ µË´Ï´Ù.
Ãß°¡ÇýÅÃ
¹è¼ÛÁ¤º¸
  • 5/9(¸ñ) À̳» ¹ß¼Û ¿¹Á¤  (¼­¿ï½Ã °­³²±¸ »ï¼º·Î 512)
  • ¹«·á¹è¼Û
ÁÖ¹®¼ö·®
°¨¼Ò Áõ°¡
  • À̺¥Æ®/±âȹÀü

  • ¿¬°üµµ¼­

  • »óÇ°±Ç

AD

ÃâÆÇ»ç ¼­Æò

Programming Languages and Methodologies presents a mature, well-rounded view of the entire programming process. Intended for the junior/senior-level student who has completed introductory programming courses, Schalkoff's text discusses the more advanced programming topics, including differing programming methodologies (imperative, declarative, functional, OO, parallel, and event-driven), the concepts of formal grammars and syntax, the concepts and implementation of scanning and parsing, and the concept of semantics. The choice of topics included allows instructors to tailor their approach to suit the needs of the course and provides a wealth of hands-on exercises and experiences. With this text instructors can support their entire course with such public domain platforms as Linux, Mac OS-X or Windows OS at no additional cost to students! Presenting topics related to the ACM/IEEE Model Curriculum, Programming Languages and Methodologies is the ideal text for your Computer Engineering and Computer Science students!

¸ñÂ÷

1. Introduction: Programming Concepts and Languages
1.1 Overview
1.2 'Productivity' and Moore's Law
1.3 Programming History: From Gears to Software Objects
1.4 Programming Paradigms and Possible Language Taxonomies
1.5 Introduction to a more Formal Viewpoint
1.6 Programming Tools
1.7 Coding Standards and Conventions
1.8 Some Humor: The Evolution of a Programmer
2. From Formal Grammars to Programming Languages
2.1 Prelude
2.2 A Syntactic Viewpoint: Programs are Strings
2.3 Formal Grammars
2.4 Using Grammars - Derivation Trees and Ambiguity
2.5 BNF and Alternatives
3. Programming in Prolog
3.1 Introduction
3.2 Prolog Syntax and Use
3.3 Alternate Imperpretations of Prolog
3.4 Parsing (Grammatical Recognition) and Prolog
3.5 Prolog and Constraint Satisfaction Problems (CSP)
4. Sample Programming Language minic: (Version 1) and Aspects of Scanning and Parsing
4.1 Overview
4.2 minic (ver 1) Syntax
4.3 Development of Parsers for minic: Basic Concerns
4.4 Parsing
4.5 Life After Parsing
5. Using Prolog for Scanning and Parsing
5.1 Scanner and parser for minic ver 1: Overall Objectives
5.2 minic Prolog Scanner
5.3 Prolog Parser
6. Scanning and Parsing minic Using flex and bison
6.1 Building Scanners and Parsers with flex and bison
6.2 flex and bison
6.3 flex
6.4 Applying flex to minic
6.5 bison
6.6 Using flex and bison Together for minic
6.7 A More Complete Example
6.8 bison: 'Under the Hood'
6.9 Toward a More Complete Parser/Compiler
7. Enhancing minic: Control Statements, Interactive Constructs, Comments and Type Checking
7.1 minic, Version 2
7.2 Scanning and parsing minic Version 2 Using flex and bison
7.3 Scanning and Parsing minic Version 2 Using Prolog
7.4 Further minic Extensions (Extended Version 2)
7.5 Scanning and Parsing minic Extended Version 2 Using flex and bison
7.6 Scanning and Parsing minic Extended Version 2 using Prolog
7.7 Considering Contextual Constraints and Yped Languages
7.8 Attribute Grammars
7.9 flex/bison Implementation of A minic Parser Using Attibute Grammars and a Symbol Table
7.10 Prolog Implementation of A minic Parser Using Attribute
8. Functional Programming and the lambda Calculus
8.1 Introduction to the lambda Calculus and Functional Programming
8.2 The Syntax and Semantics of the lambda Calculus
8.3 Functional Programming Concepts and Syntax
8.4 Side Effects and Functional Programming
8.5 Functional Programming with Typed Functions: A Preliminary Example Using ML
9. Lisp
9.1 Lisp Introduction, Pragmatics and Resources
9.2 The Lisp Top-Level Loop (EVAL)
9.3 Basic Common Lisp Building Blocks
9.4 Basic Lisp Manipulation
9.5 Lisp Booleans and Conditionals
9.6 Scope and Iteration in Lisp
9.7 I/O in COmmon Lisp
9.8 CommonLisp Macro
9.9 (Common) Lisp Programming Conventions
9.10 Funtion (Program) Design, Implementation and Correctness
9.11 Extended CommonLisp Design Example: Implementing and Training a Single Artificial Neural Unit
9.12 CommonLisp FUnctions (and Macros) You Should Know
10. Object-Oriented Functional Programming: The Common Lisp Object System
10.1 The CommonLisp Object System (CLOS)
10.2 CommonLisp Object System (CLOS)
10.3 Relation to Other Programming Languages
11. Object-Oriented, Typed Functional Programming with Modules: ML and CAML
11.1 An Introduction to SML/NJ and CAML
11.2 The SML/NJ Language
11.3 CAML and ocaml
11.4 Scanning and Parsing in CAML
11.5 CAML Compilation with ocamlc
12. Abstract Syntax and Formal Approaches to Programming Language Semantics
12.1 Programming Language Semantics
12.2 Semantics, Semantics, Semantics
12.3 A Quick Overview of Approaches to Semantics Formalization
12.4 Semantic Equivalence
12.5 Semantic Descriptions Using an Abstract Syntax
12.6 Denotational Semantics
12.7 Axiomatic Semantics
12.8 Functional Programming- Semantics and Correctness
12.9 Algebraic Semantics
13. Event-Driven Programming Part 1: Introduction and Window Examples
13.1 Introduction
13.2 Example: Microsoft Windows and the MFC
13.3 Example: The X-Windows System
13.4 Cross and Multi-Platform Software Development
14. Event-Driven Programming Part 2: PDA Programming with the PalmOS
14.1 Overview
14.2 Palm Programming Specifics, Part I
14.3 A More Elaborate Example (Buttons, Multiple Forms and A Menu)
14.4 Interaction with User-Entered Data and the 'echo' Application
14.5 Example: Numerical Input and Computations and Interaction with Fields
14.6 Additional PalmOS Programming Notes and Features
14.7 Implementing Databases on the Palm
15. Parallel Computing and Parallel Programming
15.1 Introduction
15.2 Algorithm Decomposition Techniques and Tools
15.3 Parallelism in Declarative Programming (Prolog)
15.4 Extension of Languages to Allow Concurrent Programming
15.5 MPI and Beowulf Cluster Programming
15.6 Extended MPI Examples
15.7 Selected (Abbreviated) MPI and MPE man Pages

Ã¥¼Ò°³

Programming Languages and Methodologies presents a mature, well-rounded view of the entire programming process. Intended for the junior/senior-level student who has completed introductory programming courses, Schalkoff's text discusses the more advanced programming topics, including differing programming methodologies (imperative, declarative, functional, OO, parallel, and event-driven), the concepts of formal grammars and syntax, the concepts and implementation of scanning and parsing, and the concept of semantics. The choice of topics included allows instructors to tailor their approach to suit the needs of the course and provides a wealth of hands-on exercises and experiences. With this text instructors can support their entire course with such public domain platforms as Linux, Mac OS-X or Windows OS at no additional cost to students! Presenting topics related to the ACM/IEEE Model Curriculum, Programming Languages and Methodologies is the ideal text for your Computer Engineering and Computer Science students! First Print Run Errata

ÀúÀÚ¼Ò°³

Schalkoff, Robert J. [Àú] ½ÅÀ۾˸² SMS½Åû
»ý³â¿ùÀÏ -

ÇØ´çÀÛ°¡¿¡ ´ëÇÑ ¼Ò°³°¡ ¾ø½À´Ï´Ù.

ÄÄÇ»ÅÍ ºÐ¾ß¿¡¼­ ¸¹Àº ȸ¿øÀÌ ±¸¸ÅÇÑ Ã¥

    ¸®ºä

    0.0 (ÃÑ 0°Ç)

    100ÀÚÆò

    ÀÛ¼º½Ã À¯ÀÇ»çÇ×

    ÆòÁ¡
    0/100ÀÚ
    µî·ÏÇϱâ

    100ÀÚÆò

    0.0
    (ÃÑ 0°Ç)

    ÆǸÅÀÚÁ¤º¸

    • ÀÎÅÍÆÄÅ©µµ¼­¿¡ µî·ÏµÈ ¿ÀǸ¶ÄÏ »óÇ°Àº ±× ³»¿ë°ú Ã¥ÀÓÀÌ ¸ðµÎ ÆǸÅÀÚ¿¡°Ô ÀÖÀ¸¸ç, ÀÎÅÍÆÄÅ©µµ¼­´Â ÇØ´ç »óÇ°°ú ³»¿ë¿¡ ´ëÇØ Ã¥ÀÓÁöÁö ¾Ê½À´Ï´Ù.

    »óÈ£

    (ÁÖ)±³º¸¹®°í

    ´ëÇ¥ÀÚ¸í

    ¾Èº´Çö

    »ç¾÷ÀÚµî·Ï¹øÈ£

    102-81-11670

    ¿¬¶ôó

    1544-1900

    ÀüÀÚ¿ìÆíÁÖ¼Ò

    callcenter@kyobobook.co.kr

    Åë½ÅÆǸž÷½Å°í¹øÈ£

    01-0653

    ¿µ¾÷¼ÒÀçÁö

    ¼­¿ïƯº°½Ã Á¾·Î±¸ Á¾·Î 1(Á¾·Î1°¡,±³º¸ºôµù)

    ±³È¯/ȯºÒ

    ¹ÝÇ°/±³È¯ ¹æ¹ý

    ¡®¸¶ÀÌÆäÀÌÁö > Ãë¼Ò/¹ÝÇ°/±³È¯/ȯºÒ¡¯ ¿¡¼­ ½Åû ¶Ç´Â 1:1 ¹®ÀÇ °Ô½ÃÆÇ ¹× °í°´¼¾ÅÍ(1577-2555)¿¡¼­ ½Åû °¡´É

    ¹ÝÇ°/±³È¯°¡´É ±â°£

    º¯½É ¹ÝÇ°ÀÇ °æ¿ì Ãâ°í¿Ï·á ÈÄ 6ÀÏ(¿µ¾÷ÀÏ ±âÁØ) À̳»±îÁö¸¸ °¡´É
    ´Ü, »óÇ°ÀÇ °áÇÔ ¹× °è¾à³»¿ë°ú ´Ù¸¦ °æ¿ì ¹®Á¦Á¡ ¹ß°ß ÈÄ 30ÀÏ À̳»

    ¹ÝÇ°/±³È¯ ºñ¿ë

    º¯½É ȤÀº ±¸¸ÅÂø¿À·Î ÀÎÇÑ ¹ÝÇ°/±³È¯Àº ¹Ý¼Û·á °í°´ ºÎ´ã
    »óÇ°À̳ª ¼­ºñ½º ÀÚüÀÇ ÇÏÀÚ·Î ÀÎÇÑ ±³È¯/¹ÝÇ°Àº ¹Ý¼Û·á ÆǸÅÀÚ ºÎ´ã

    ¹ÝÇ°/±³È¯ ºÒ°¡ »çÀ¯

    ·¼ÒºñÀÚÀÇ Ã¥ÀÓ ÀÖ´Â »çÀ¯·Î »óÇ° µîÀÌ ¼Õ½Ç ¶Ç´Â ÈÑ¼ÕµÈ °æ¿ì
    (´ÜÁö È®ÀÎÀ» À§ÇÑ Æ÷Àå ÈѼÕÀº Á¦¿Ü)

    ·¼ÒºñÀÚÀÇ »ç¿ë, Æ÷Àå °³ºÀ¿¡ ÀÇÇØ »óÇ° µîÀÇ °¡Ä¡°¡ ÇöÀúÈ÷ °¨¼ÒÇÑ °æ¿ì
    ¿¹) È­ÀåÇ°, ½ÄÇ°, °¡ÀüÁ¦Ç°(¾Ç¼¼¼­¸® Æ÷ÇÔ) µî

    ·º¹Á¦°¡ °¡´ÉÇÑ »óÇ° µîÀÇ Æ÷ÀåÀ» ÈѼÕÇÑ °æ¿ì
    ¿¹) À½¹Ý/DVD/ºñµð¿À, ¼ÒÇÁÆ®¿þ¾î, ¸¸È­Ã¥, ÀâÁö, ¿µ»ó È­º¸Áý

    ·½Ã°£ÀÇ °æ°ú¿¡ ÀÇÇØ ÀçÆǸŰ¡ °ï¶õÇÑ Á¤µµ·Î °¡Ä¡°¡ ÇöÀúÈ÷ °¨¼ÒÇÑ °æ¿ì

    ·ÀüÀÚ»ó°Å·¡ µî¿¡¼­ÀÇ ¼ÒºñÀÚº¸È£¿¡ °üÇÑ ¹ý·üÀÌ Á¤ÇÏ´Â ¼ÒºñÀÚ Ã»¾àöȸ Á¦ÇÑ ³»¿ë¿¡ ÇØ´çµÇ´Â °æ¿ì

    »óÇ° Ç°Àý

    °ø±Þ»ç(ÃâÆÇ»ç) Àç°í »çÁ¤¿¡ ÀÇÇØ Ç°Àý/Áö¿¬µÉ ¼ö ÀÖÀ½

    ¼ÒºñÀÚ ÇÇÇغ¸»ó
    ȯºÒÁö¿¬¿¡ µû¸¥ ¹è»ó

    ·»óÇ°ÀÇ ºÒ·®¿¡ ÀÇÇÑ ±³È¯, A/S, ȯºÒ, Ç°Áúº¸Áõ ¹× ÇÇÇغ¸»ó µî¿¡ °üÇÑ »çÇ×Àº ¼ÒºñÀÚºÐÀïÇØ°á ±âÁØ (°øÁ¤°Å·¡À§¿øȸ °í½Ã)¿¡ ÁØÇÏ¿© 󸮵Ê

    ·´ë±Ý ȯºÒ ¹× ȯºÒÁö¿¬¿¡ µû¸¥ ¹è»ó±Ý Áö±Þ Á¶°Ç, ÀýÂ÷ µîÀº ÀüÀÚ»ó°Å·¡ µî¿¡¼­ÀÇ ¼ÒºñÀÚ º¸È£¿¡ °üÇÑ ¹ý·ü¿¡ µû¶ó ó¸®ÇÔ

    (ÁÖ)KGÀ̴Ͻýº ±¸¸Å¾ÈÀü¼­ºñ½º¼­ºñ½º °¡ÀÔ»ç½Ç È®ÀÎ

    (ÁÖ)ÀÎÅÍÆÄÅ©Ä¿¸Ó½º´Â ȸ¿ø´ÔµéÀÇ ¾ÈÀü°Å·¡¸¦ À§ÇØ ±¸¸Å±Ý¾×, °áÁ¦¼ö´Ü¿¡ »ó°ü¾øÀÌ (ÁÖ)ÀÎÅÍÆÄÅ©Ä¿¸Ó½º¸¦ ÅëÇÑ ¸ðµç °Å·¡¿¡ ´ëÇÏ¿©
    (ÁÖ)KGÀ̴Ͻýº°¡ Á¦°øÇÏ´Â ±¸¸Å¾ÈÀü¼­ºñ½º¸¦ Àû¿ëÇÏ°í ÀÖ½À´Ï´Ù.

    ¹è¼Û¾È³»

    • ±³º¸¹®°í »óÇ°Àº Åùè·Î ¹è¼ÛµÇ¸ç, Ãâ°í¿Ï·á 1~2Àϳ» »óÇ°À» ¹Þ¾Æ º¸½Ç ¼ö ÀÖ½À´Ï´Ù.

    • Ãâ°í°¡´É ½Ã°£ÀÌ ¼­·Î ´Ù¸¥ »óÇ°À» ÇÔ²² ÁÖ¹®ÇÒ °æ¿ì Ãâ°í°¡´É ½Ã°£ÀÌ °¡Àå ±ä »óÇ°À» ±âÁØÀ¸·Î ¹è¼ÛµË´Ï´Ù.

    • ±ººÎ´ë, ±³µµ¼Ò µî ƯÁ¤±â°üÀº ¿ìü±¹ Åù踸 ¹è¼Û°¡´ÉÇÕ´Ï´Ù.

    • ¹è¼Ûºñ´Â ¾÷ü ¹è¼Ûºñ Á¤Ã¥¿¡ µû¸¨´Ï´Ù.

    • - µµ¼­ ±¸¸Å ½Ã 15,000¿ø ÀÌ»ó ¹«·á¹è¼Û, 15,000¿ø ¹Ì¸¸ 2,500¿ø - »óÇ°º° ¹è¼Ûºñ°¡ ÀÖ´Â °æ¿ì, »óÇ°º° ¹è¼Ûºñ Á¤Ã¥ Àû¿ë