Of Rats And Dragons

•

0 gefällt mir•793 views

Reviews grammar and parsers and discusses my personal path toward writing my own packrat parser-generator for Erlang called neotoma. Given to "Evil Robot Conference" on September 12, 2009.

Technologie

Of Rats And
Dragons
Achieving Parsing Sanity

Sean Cribbs

Web Consultant
Ruby and Erlang Hacker

Saturday, September 12, 2009

Quick Review
Saturday, September 12, 2009

context-free
grammars

Saturday, September 12, 2009

G = (V, Σ, R, S)

Saturday, September 12, 2009

non-deterministic
pushdown
automata

Saturday, September 12, 2009

stack machine
w/ backtracking

Saturday, September 12, 2009

massage it

Saturday, September 12, 2009

ε productions

Saturday, September 12, 2009

produce nothing
never produced

Saturday, September 12, 2009

ambiguities
“dangling else”

Saturday, September 12, 2009

if A then if B then C else D

if A then if B then C else D

if A then if B then C else D

Saturday, September 12, 2009

parsing expression
grammars

Saturday, September 12, 2009

top-down parsing
language (70’s)

Saturday, September 12, 2009

direct
representation of
parsing functions

Saturday, September 12, 2009

Brian Ford 2002

Saturday, September 12, 2009

focused on
recognizing

Saturday, September 12, 2009

computer
languages

Saturday, September 12, 2009

“string”
.

Saturday, September 12, 2009

PEG > regexps

Saturday, September 12, 2009

combined
lex+parse

Saturday, September 12, 2009

no ambiguity

Saturday, September 12, 2009

choice is ordered

Saturday, September 12, 2009

dangling else
obviated

Saturday, September 12, 2009

greedy repetition

Saturday, September 12, 2009

unlimited
lookahead
with predicates

Saturday, September 12, 2009

no left-recursion!
(use *,+)

Saturday, September 12, 2009

Parsing
Techniques

Saturday, September 12, 2009

Tabular
test every rule

Saturday, September 12, 2009

Recursive-descent
call & consume

Saturday, September 12, 2009

Predictive
yacc/yecc

Saturday, September 12, 2009

Packrat
RD with memo

Saturday, September 12, 2009

sacriﬁce memory
for speed

Saturday, September 12, 2009

supports PEGs and
some CFGs

Saturday, September 12, 2009

Treetop
Pappy
neotoma

Saturday, September 12, 2009

neotoma
Behind the CodeTM

Saturday, September 12, 2009

can:has(cukes) ->
false.

Saturday, September 12, 2009

Cucumber uses
Treetop

Saturday, September 12, 2009

PEG → leex/yecc
FAIL

Saturday, September 12, 2009

parsec → eParSec

Saturday, September 12, 2009

HOF protocol

Saturday, September 12, 2009

$% Implements "?" PEG operator optional(P) -> fun(Input, Index) -> case P(Input, Index) of {fail, _} -> {[], Input, Index}; {_,_,_} = Success -> Success % {Parsed, RemainingInput, NewIndex} end end. Saturday, September 12, 2009$

% PEG
optional_space <- space?;

% Erlang
optional_space(Input,Index) ->
optional(fun space/2)(Input, Index).

Saturday, September 12, 2009

Yay! RD!
make it memo

Saturday, September 12, 2009

ets
Erlang Term
Storage

Saturday, September 12, 2009

{key, value}

Saturday, September 12, 2009

key = Index

Saturday, September 12, 2009

value = dict

Saturday, September 12, 2009

$% Memoization wrapper p(Inp, StartIndex, Name, ParseFun, TransformFun) -> % Grab the memo table from ets Memo = get_memo(StartIndex), % See if the current reduction is memoized case dict:find(Name, Memo) of % If it is, return the result {ok, Result} -> Result; % If not, attempt to parse _ -> case ParseFun(Inp, StartIndex) of % If it fails, memoize the failure {fail,_} = Failure -> memoize(StartIndex, dict:store(Name, Failure, Memo)), Failure; % If it passes, transform and memoize the result. {Result, InpRem, NewIndex} -> Transformed = TransformFun(Result, StartIndex), memoize(StartIndex, dict:store(Name, {Transformed, InpRem, NewIndex}, Memo)), {Transformed, InpRem, NewIndex} end end. Saturday, September 12, 2009$

parse_transform

Saturday, September 12, 2009

alternative(Input, Index) ->
peg:p(Input, Index, alternative, fun(I,P) ->
peg:choose([fun sequence/2, fun primary/2])(I,P)
end).

rule(alternative) ->
peg:choose([fun sequence/2, fun primary/2]);

Saturday, September 12, 2009

rules <- space? declaration_sequence space?;
declaration_sequence <- head:declaration tail:(space declaration)*;
declaration <- nonterminal space '<-' space parsing_expression space? ';';
parsing_expression <- choice / sequence / primary;
choice <- head:alternative tail:(space '/' space alternative)+;
alternative <- sequence / primary;
primary <- prefix atomic / atomic suffix / atomic;
sequence <- head:labeled_sequence_primary tail:(space labeled_sequence_primary)+;
labeled_sequence_primary <- label? primary;
label <- alpha_char alphanumeric_char* ':';
suffix <- repetition_suffix / optional_suffix;
optional_suffix <- '?';
repetition_suffix <- '+' / '*';
prefix <- '&' / '!';
atomic <- terminal / nonterminal / parenthesized_expression;
parenthesized_expression <- '(' space? parsing_expression space? ')';
nonterminal <- alpha_char alphanumeric_char*;
terminal <- quoted_string / character_class / anything_symbol;
quoted_string <- single_quoted_string / double_quoted_string;
double_quoted_string <- '"' string:(!'"' ("" / '"' / .))* '"';
single_quoted_string <- "'" string:(!"'" ("" / "'" / .))* "'";
character_class <- '[' characters:(!']' ('' . / !'' .))+ ']
anything_symbol <- '.';
alpha_char <- [a-z_];
alphanumeric_char <- alpha_char / [0-9];
space <- (white / comment_to_eol)+;
comment_to_eol <- '%' (!"n" .)*;
white <- [ tnr];

Saturday, September 12, 2009

self-hosting

Saturday, September 12, 2009

Future directions

Saturday, September 12, 2009

self-contained
parsers

Saturday, September 12, 2009

inline code in PEG

Saturday, September 12, 2009

Reia
retem
sedate

Saturday, September 12, 2009

questions?

Saturday, September 12, 2009

Weitere ähnliche Inhalte

Andere mochten auch

Ftp

Hover Ige

Income statement

One direction

Utfordringer ved interhospital intensivtransport i Norge

Helge Eiding

French Revolution Comic

drloewen

Microsoft Learning Experiences Skills and Employability

Lee Stott

Smart Student Tracking System for Schools and Parents from CodeLand

Sachidanand Bhat

The oversampling recruitment is a limiting factor in high frequency application such as software defined radio. This project is a high frequency processing and low oversampling ratio. A single bit semi parallel processing is proposed in this paper. Using this single bit PDSM Architecture, high speed, high complexity computations are executed in parallel. The single bit DSM is to build an RF transmitter that includes a one bit quantifier with two level switching power amplifier for high linearity and high efficiency. Performance analysis by using the MATLAB simulations by reducing the oversampling ratio by same signal to noise ratio. The DSM implemented on field programmable gate array and using a signal code division multiple access signal. This project will give bandwidth of the low oversampled signal increased four times without increasing frequency. Finally they can be achieved signal to noise ratio is very low and also oversampling ratio is small.

DSM Based low oversampling using SDR transmitter

IJTET Journal

Computadora (tecnologia)

Brendadeprada

Practica 20 mayo 2016

Luis López

2015-CV-Marina-Micic-V2

Marina Micik

Arabic script is one of the most widely used scripts in the world. Besides 340 millions native speakers, more than 200 million nonnative speakers are there in the world. Many languages such as Urdu, Persian, etc. adopted this script. Therefore, recognition of optical handwritten Arabic characters has received significant attention from the past decade. Unlike numerals of any other scripts, some Arabic numerals have more than one representation. For instance, Arabic ‘4’, ‘5’ and ‘7’ have two variations each. Considering these variants as the same class may deviate the recognition performance. The present work proposed a mechanism to deal with such variations for improved classification. At the first phase, the recognition problem is considered as a 13 class classification problem instead of 10. Then, in the second phase, the classes are reorganized and post-processed for improved classification. A comparative study has also been included with the conventional approach that considers the variants as the same class. Experimental results reflect the efficiency of the proposed technique.

Recognition of Isolated Handwritten Arabic and Urdu Numerals along with their...

Association of Scientists, Developers and Faculties

Colegio El Rosario 2016 -Partido seleccion y maestros

Luis López

Lessening in test force is vital to enhance battery lifetime in versatile electronic gadgets utilizing intermittent individual test. It's to expand dependability of testing, and to lessen test expense. A conservative test set with exceedingly viable examples, every identifying different issues, is attractive for lower test expenses. Such examples build exchanging action amid dispatch and catch operations. In this paper, we exhibit a novel circuit strategy to essentially dispense with test force dissemination in combinational logic by veiling sign moves at the logic inputs amid sweep moving is exhibited. We execute the concealing impact by embeddings an additional supply gating transistor in the supply to ground way for the first-level doors at the yields of the output flip-flops. The gating transistor supply is killed in the output in mode, basically gating the supply. Further, DFT punishments are decreased by embracing specific trigger Scan structural planning. This building design diminishes exchanging action in the circuit-under-test (CUT) and builds the clock recurrence of the checking methodology. The assistant chain moves in the contrast between sequential test vectors and just the obliged moves (alluded to as trigger information) are connected. Power necessities are significantly decreased by the utilization of a two-stage heuristic technique. Utilizing ISCAS 89 benchmark circuits, this adequacy is to enhance SoC test measures (power, time, and information volume) is tentatively assessed and affirmed.

Techniques for Minimizing Power Consumption in DFT during Scan Test Activity

IJTET Journal

Project management overview

LineView Academy (was OFX Academy)

Andere mochten auch (16)

Ftp

Hover Ige

Income statement

One direction

Utfordringer ved interhospital intensivtransport i Norge

French Revolution Comic

Microsoft Learning Experiences Skills and Employability

Smart Student Tracking System for Schools and Parents from CodeLand

DSM Based low oversampling using SDR transmitter

Computadora (tecnologia)

Practica 20 mayo 2016

2015-CV-Marina-Micic-V2

Recognition of Isolated Handwritten Arabic and Urdu Numerals along with their...

Colegio El Rosario 2016 -Partido seleccion y maestros

Techniques for Minimizing Power Consumption in DFT during Scan Test Activity

Project management overview

Ähnlich wie Of Rats And Dragons

DelveUI Slides

jkosoy

2011 NOTE: Some links in this presentation are no longer valid. Sorry about that. As a professional developer, especially one who works in Ruby, you hear about code quality all the time. You learn that testing your code and making it easy to maintain are the path to success. You know about TDD, BDD, TATFT and LMNOP. You learn to cycle from red to green to refactoring. We all do our best to write quality, maintainable, reusable code. We're all human, though; some of us slip, and some of us have had to work hard at preventing code smells. In this talk, I'll talk about how I learned to program, how going pro exposed flaws in my coding style, and how I'm working to improve my code quality, sharing some of my old stinky code, the better, refactored versions, and the lessons I've learned in honing my craft.

Code Stinkers Anonymous

Mark Cornick

This slide set was used in job-embedded professional development on 09.09.09 and is designed to give a brief overview of many Google features. These features all have at least some application in the world of public education. Although this slide set does not address Google apps for education, (and barely grazes Google Docs) it does provide a glimpse into the creative engine that is Google. How can these feature sets be used within your classroom?

Google in Education (just a peek)

North Kansas City Schools

Building A Framework On Rack

Matt Todd

Semcomp de São Carlos

Fabio Akita

Software livre e padrões abertos no desenvolvimento Web

Felipe Ribeiro

Its all about collaboration

Richard Wallis

Localizing iOS Apps

weissazool

100% JS

__lucas

Latinoware Rails 2009

Fabio Akita

Expand to or work in China and Germany

Daniel Bovensiepen

Zeno rocha - HTML5 APIs para Mobile

iMasters

Mobile Approaches - LinguÁgil 2012

Pedro E. Cunha Brigatto

Spring in-the-cloud

Joshua Long

06 Data

Hadley Wickham

2009, o ano do Ruby on Rails no Brasil - CaelumDay 2009

Caue Guerra

The Beauty of Bootstrapping - Doing it Anyway

Chris Schultz

Kostentreiber bei der iOS Entwicklung

Reto Zenger

Kostentreiber bei der iOS-Entwicklung

xrb

Oxente on Rails 2009

Fabio Akita

Ähnlich wie Of Rats And Dragons (20)

DelveUI Slides

Code Stinkers Anonymous

Google in Education (just a peek)

Building A Framework On Rack

Semcomp de São Carlos

Software livre e padrões abertos no desenvolvimento Web

Its all about collaboration

Localizing iOS Apps

100% JS

Latinoware Rails 2009

Expand to or work in China and Germany

Zeno rocha - HTML5 APIs para Mobile

Mobile Approaches - LinguÁgil 2012

Spring in-the-cloud

06 Data

2009, o ano do Ruby on Rails no Brasil - CaelumDay 2009

The Beauty of Bootstrapping - Doing it Anyway

Kostentreiber bei der iOS Entwicklung

Kostentreiber bei der iOS-Entwicklung

Oxente on Rails 2009

Mehr von Sean Cribbs

There are many reasons to use an eventually-consistent database — like Riak, Voldemort, or Cassandra — including increased availability, lower latency, and fault-tolerance. However, doing so requires a mental shift in how to structure client applications, and certain types of traditional data-structures, like sets, registers, and counters can’t be resolved simply in the face of race-conditions. It is difficult to achieve “logical monotonicity” except for the most trivial data-types. That is, until the advent of Convergent Replicated Data Types (CRDTs). CRDTs are data-structures that tolerate eventual consistency. They replace traditional data-structure implementations and all have the property that, given any number of conflicting versions of the same datum, there is a single state on which they converge (monotonicity). This talk will discuss some of the most useful CRDTs and how to apply them to solve real-world data problems.

Eventually Consistent Data Structures (from strangeloop12)

Sean Cribbs

There are many reasons to use an eventually-consistent database -- like Riak, Voldemort, or Cassandra -- including increased availability, lower latency, and fault-tolerance. However, doing so requires a mental shift in how to structure client applications, and certain types of traditional data-structures, like sets, registers, and counters can't be resolved simply in the face of race-conditions. It is difficult to achieve "logical monotonicity" except for the most trivial data-types. That is, until the advent of Conflict-Free Replicated Data Types (CRDTs). CRDTs are data-structures that tolerate eventual consistency. They replace traditional data-structure implementations and all have the property that, given any number of conflicting versions of the same datum, there is a single state on which they converge (monotonicity). This talk will discuss some of the most useful CRDTs and how to apply them to solve real-world data problems.

Eventually-Consistent Data Structures

Sean Cribbs

Concurrency in Ruby is all the rage these days, and people can't seem to agree whether Threads, Fibers, event loops, or actors are the best solution. But did you ever consider that your *sequential* Ruby program might be concurrent, with nary a Thread, Fiber, or callback in sight? Well, it happened to me. This is the story of how accidental concurrency (also known as re-entrancy) broke my brain multiple times over the course of two years, spawned flamewars on Twitter, long blog posts, and the various solutions I took to solve the problem. Along the way we'll illuminate some subtleties of concurrent programming in Ruby, differences between several Ruby implementations, and how we can all write code that is friendlier when accidental concurrency strikes.

A Case of Accidental Concurrency

Sean Cribbs

So, there's this "NoSQL" thing you may have heard of, and this related thing called "eventual consistency". Supposedly, they help you scale, but no one has ever explained why! Well, wonder no more! This talk will demystify NoSQL, eventual consistency, how they might help you scale, and -- most importantly -- why you should care. We'll look closely at how Riak, a linearly-scalable, distributed and fault-tolerant NoSQL datastore, implements eventual consistency, and how you can harness it from Ruby via the slick Ripple client/ORM. When the talk is finished, you'll have the tools both to understand eventual consistency and to handle it like a pro inside your next Ruby application.

Embrace NoSQL and Eventual Consistency with Ripple

Sean Cribbs

Riak with node.js

Sean Cribbs

Schema Design for Riak (Take 2)

Sean Cribbs

Riak (Øredev nosql day)

Sean Cribbs

Riak Tutorial (Øredev)

Sean Cribbs

The Radiant Ethic

Sean Cribbs

Introduction to Riak and Ripple (KC.rb)

Sean Cribbs

Riak with Rails

Sean Cribbs

Schema Design for Riak

Sean Cribbs

Introduction to Riak - Red Dirt Ruby Conf Training

Sean Cribbs

Introducing Riak and Ripple

Sean Cribbs

Many developers will be familiar with lex, flex, yacc, bison, ANTLR, and other related tools to generate parsers for use inside their own code. For recognizing computer-friendly languages, however, context-free grammars and their parser-generators leave a few things to be desired. This is about how the seemingly simple prospect of parsing some text turned into a new parser toolkit for Erlang, and why functional programming makes parsing fun and awesome

Round PEG, Round Hole - Parsing Functionally

Sean Cribbs

Software projects are rarely on-spec, on-time and on-budget, and the primary cause is miscommunication. As Martin Fowler says, there is a "yawning crevasse of doom" between stakeholders and developers, full of misunderstanding. How do you make sure that you're building something that adds value? How do you know you're building the thing that was asked for? How does your bottom line affect user experience? Into the fray leaps Cucumber, a business-readable DSL combined with an awesome Ruby library that lets domain experts express business requirements as executable user stories. We'll cover outside-in, story-driven development with Cucumber, how to write effective stories, and how to make Cucumber work for your project. (as given to CharlotteRuby on Jan 6, 2010)

Story Driven Development With Cucumber

Sean Cribbs

Most developers will be familiar with lex, flex, yacc, bison, ANTLR, and other tools to generate parsers for use inside their own code. Erlang, the concurrent functional programming language, has its own pair, leex and yecc, for accomplishing most complicated text-processing tasks. This talk is about how the seemingly simple prospect of parsing text turned into a new parser toolkit for Erlang, and why functional programming makes parsing fun and awesome.

Achieving Parsing Sanity In Erlang

Sean Cribbs

Erlang/OTP for Rubyists

Sean Cribbs

Content Management That Won't Rot Your Brain

Sean Cribbs

Mehr von Sean Cribbs (19)

Eventually Consistent Data Structures (from strangeloop12)

Eventually-Consistent Data Structures

A Case of Accidental Concurrency

Embrace NoSQL and Eventual Consistency with Ripple

Riak with node.js

Schema Design for Riak (Take 2)

Riak (Øredev nosql day)

Riak Tutorial (Øredev)

The Radiant Ethic

Introduction to Riak and Ripple (KC.rb)

Riak with Rails

Schema Design for Riak

Introduction to Riak - Red Dirt Ruby Conf Training

Introducing Riak and Ripple

Round PEG, Round Hole - Parsing Functionally

Story Driven Development With Cucumber

Achieving Parsing Sanity In Erlang

Erlang/OTP for Rubyists

Content Management That Won't Rot Your Brain

Kürzlich hochgeladen

Boost Fertility New Invention Ups Success Rates.pdf

sudhanshuwaghmare1

What are drone anti-jamming systems? The drone anti-jamming systems and anti-spoof technology protect against interference, jamming, and spoofing of the UAVs. To protect their security, countries are beginning to research drone anti-jamming systems, also known as drone strike weapons. The anti-jam and anti-spoof technology protects against interference, jamming and spoofing. A drone strike weapon is a drone attack weapon that can attack and destroy enemy drones. So what is so unique about this amazing system?

What Are The Drone Anti-jamming Systems Technology?

Antenna Manufacturer Coco

Imagine a world where information flows as swiftly as thought itself, making decision-making as fluid as the data driving it. Every moment is critical, and the right tools can significantly boost your organization’s performance. The power of real-time data automation through FME can turn this vision into reality. Aimed at professionals eager to leverage real-time data for enhanced decision-making and efficiency, this webinar will cover the essentials of real-time data and its significance. We’ll explore: FME’s role in real-time event processing, from data intake and analysis to transformation and reporting An overview of leveraging streams vs. automations FME’s impact across various industries highlighted by real-life case studies Live demonstrations on setting up FME workflows for real-time data Practical advice on getting started, best practices, and tips for effective implementation Join us to enhance your skills in real-time data automation with FME, and take your operational capabilities to the next level.

From Event to Action: Accelerate Your Decision Making with Real-Time Automation

Safe Software

Tech Trends Report 2024 Future Today Institute.pdf

hans926745

Sara Mae O’Brien Scott and Tatiana Baquero Cakici, Senior Consultants at Enterprise Knowledge (EK), presented “AI Fast Track to Search-Focused AI Solutions” at the Information Architecture Conference (IAC24) that took place on April 11, 2024 in Seattle, WA. In their presentation, O’Brien-Scott and Cakici focused on what Enterprise AI is, why it is important, and what it takes to empower organizations to get started on a search-based AI journey and stay on track. The presentation explored the complexities of enterprise search challenges and how IA principles can be leveraged to provide AI solutions through the use of a semantic layer. O’Brien-Scott and Cakici showcased a case study where a taxonomy, an ontology, and a knowledge graph were used to structure content at a healthcare workforce solutions organization, providing personalized content recommendations and increasing content findability. In this session, participants gained insights about the following: Most common types of AI categories and use cases; Recommended steps to design and implement taxonomies and ontologies, ensuring they evolve effectively and support the organization’s search objectives; Taxonomy and ontology design considerations and best practices; Real-world AI applications that illustrated the value of taxonomies, ontologies, and knowledge graphs; and Tools, roles, and skills to design and implement AI-powered search solutions.

IAC 2024 - IA Fast Track to Search Focused AI Solutions

Enterprise Knowledge

CNv6 Instructor Chapter 6 Quality of Service

giselly40

Finology Group – Insurtech Innovation Award 2024

The Digital Insurer

Scaling API-first – The story of a global engineering organization

Radu Cotescu

This presentations targets students or working professionals. You may know Google for search, YouTube, Android, Chrome, and Gmail, but did you know Google has many developer tools, platforms & APIs? This comprehensive yet still high-level overview outlines the most impactful tools for where to run your code, store & analyze your data. It will also inspire you as to what's possible. This talk is 50 minutes in length.

Powerful Google developer tools for immediate impact! (2023-24 C)

wesley chun

The presentation explores the development and application of artificial intelligence (AI) from its inception to its current status in the modern world. The term "artificial intelligence" was first coined by John McCarthy in 1956 to describe efforts to develop computer programs capable of performing tasks that typically require human intelligence. This concept was first introduced at a conference held at Dartmouth College, where programs demonstrated capabilities such as playing chess, proving theorems, and interpreting texts. In the early stages, Alan Turing contributed to the field by defining intelligence as the ability of a being to respond to certain questions intelligently, proposing what is now known as the Turing Test to evaluate the presence of intelligent behavior in machines. As the decades progressed, AI evolved significantly. The 1980s focused on machine learning, teaching computers to learn from data, leading to the development of models that could improve their performance based on their experiences. The 1990s and 2000s saw further advances in algorithms and computational power, which allowed for more sophisticated data analysis techniques, including data mining. By the 2010s, the proliferation of big data and the refinement of deep learning techniques enabled AI to become mainstream. Notable milestones included the success of Google's AlphaGo and advancements in autonomous vehicles by companies like Tesla and Waymo. A major theme of the presentation is the application of generative AI, which has been used for tasks such as natural language text generation, translation, and question answering. Generative AI uses large datasets to train models that can then produce new, coherent pieces of text or other media. The presentation also discusses the ethical implications and the need for regulation in AI, highlighting issues such as privacy, bias, and the potential for misuse. These concerns have prompted calls for comprehensive regulations to ensure the safe and equitable use of AI technologies. Artificial intelligence has also played a significant role in healthcare, particularly highlighted during the COVID-19 pandemic, where it was used in drug discovery, vaccine development, and analyzing the spread of the virus. The capabilities of AI in healthcare are vast, ranging from medical diagnostics to personalized medicine, demonstrating the technology's potential to revolutionize fields beyond just technical or consumer applications. In conclusion, AI continues to be a rapidly evolving field with significant implications for various aspects of society. The development from theoretical concepts to real-world applications illustrates both the potential benefits and the challenges that come with integrating advanced technologies into everyday life. The ongoing discussion about AI ethics and regulation underscores the importance of managing these technologies responsibly to maximize their their benefits while minimizing potential harms.

Artificial Intelligence: Facts and Myths

Joaquim Jorge

BooK Now Call us at +918448380779 to hire a gorgeous and seductive call girl for sex. Take a Delhi Escort Service. The help of our escort agency is mostly meant for men who want sexual Indian Escorts In Delhi NCR. It should be noted that any impersonator will get 100 attention from our Young Girls Escorts in Delhi. They will assume the position of reliable allies. VIP Call Girl With Original Photos Book Tonight +918448380779 Our Cheap Price 1 Hour not available 2 Hours 5000 Full Night 8000 TAG: Call Girls in Delhi, Noida, Gurgaon, Ghaziabad, Connaught Place, Greater Kailash Delhi, Lajpat Nagar Delhi, Mayur Vihar Delhi, Chanakyapuri Delhi, New Friends Colony Delhi, Majnu Ka Tilla, Karol Bagh, Malviya Nagar, Saket, Khan Market, Noida Sector 18, Noida Sector 76, Noida Sector 51, Gurgaon Mg Road, Iffco Chowk Gurgaon, Rajiv Chowk Gurgaon All Delhi Ncr Free Home Deliver

08448380779 Call Girls In Civil Lines Women Seeking Men

Delhi Call girls

08448380779 Call Girls In Greater Kailash - I Women Seeking Men

Delhi Call girls

Histor y of HAM Radio presentation slide

vu2urc

2024: Domino Containers - The Next Step. News from the Domino Container commu...

Martijn de Jong

How to Troubleshoot Apps for the Modern Connected Worker

ThousandEyes

Handwritten Text Recognition for manuscripts and early printed texts

Maria Levchenko

Workshop - Best of Both Worlds_ Combine KG and Vector search for enhanced R...

Neo4j

Building Digital Trust in a Digital Economy Veronica Tan, Director - Cyber Security Agency of Singapore Apidays Singapore 2024: Connecting Customers, Business and Technology (April 17 & 18, 2024) ------ Check out our conferences at https://www.apidays.global/ Do you want to sponsor or talk at one of our conferences? https://apidays.typeform.com/to/ILJeAaV8 Learn more on APIscene, the global media made by the community for the community: https://www.apiscene.io Explore the API ecosystem with the API Landscape: https://apilandscape.apiscene.io/

Apidays Singapore 2024 - Building Digital Trust in a Digital Economy by Veron...

apidays

A Domino Admins Adventures (Engage 2024)

Gabriella Davis

08448380779 Call Girls In Diplomatic Enclave Women Seeking Men

Delhi Call girls

Kürzlich hochgeladen (20)

Boost Fertility New Invention Ups Success Rates.pdf

What Are The Drone Anti-jamming Systems Technology?

From Event to Action: Accelerate Your Decision Making with Real-Time Automation

Tech Trends Report 2024 Future Today Institute.pdf

IAC 2024 - IA Fast Track to Search Focused AI Solutions

CNv6 Instructor Chapter 6 Quality of Service

Finology Group – Insurtech Innovation Award 2024

Scaling API-first – The story of a global engineering organization

Powerful Google developer tools for immediate impact! (2023-24 C)

Artificial Intelligence: Facts and Myths

08448380779 Call Girls In Civil Lines Women Seeking Men

08448380779 Call Girls In Greater Kailash - I Women Seeking Men

Histor y of HAM Radio presentation slide

2024: Domino Containers - The Next Step. News from the Domino Container commu...

How to Troubleshoot Apps for the Modern Connected Worker

Handwritten Text Recognition for manuscripts and early printed texts

Workshop - Best of Both Worlds_ Combine KG and Vector search for enhanced R...

Apidays Singapore 2024 - Building Digital Trust in a Digital Economy by Veron...

A Domino Admins Adventures (Engage 2024)

08448380779 Call Girls In Diplomatic Enclave Women Seeking Men

Of Rats And Dragons

1. Of Rats And Dragons Achieving Parsing Sanity Sean Cribbs Web Consultant Ruby and Erlang Hacker Saturday, September 12, 2009

2. Quick Review Saturday, September 12, 2009

3. context-free grammars Saturday, September 12, 2009

4. G = (V, Σ, R, S) Saturday, September 12, 2009

5. V→w Saturday, September 12, 2009

6. non-deterministic pushdown automata Saturday, September 12, 2009

7. stack machine w/ backtracking Saturday, September 12, 2009

8. massage it Saturday, September 12, 2009

9. ε productions Saturday, September 12, 2009

10. produce nothing never produced Saturday, September 12, 2009

11. cycles Saturday, September 12, 2009

12. ambiguities “dangling else” Saturday, September 12, 2009

13. if A then if B then C else D if A then if B then C else D if A then if B then C else D Saturday, September 12, 2009

14. parsing expression grammars Saturday, September 12, 2009

15. top-down parsing language (70’s) Saturday, September 12, 2009

16. direct representation of parsing functions Saturday, September 12, 2009

17. Brian Ford 2002 Saturday, September 12, 2009

18. focused on recognizing Saturday, September 12, 2009

19. computer languages Saturday, September 12, 2009

20. V←e Saturday, September 12, 2009

21. e1 e2 Saturday, September 12, 2009

22. e1 / e2 Saturday, September 12, 2009

23. e+ Saturday, September 12, 2009

24. e* Saturday, September 12, 2009

25. &e Saturday, September 12, 2009

26. !e Saturday, September 12, 2009

27. e? Saturday, September 12, 2009

28. “string” . Saturday, September 12, 2009

29. PEG > regexps Saturday, September 12, 2009

30. combined lex+parse Saturday, September 12, 2009

31. no ambiguity Saturday, September 12, 2009

32. choice is ordered Saturday, September 12, 2009

33. dangling else obviated Saturday, September 12, 2009

34. greedy repetition Saturday, September 12, 2009

35. unlimited lookahead with predicates Saturday, September 12, 2009

36. no left-recursion! (use *,+) Saturday, September 12, 2009

37. Parsing Techniques Saturday, September 12, 2009

38. Tabular test every rule Saturday, September 12, 2009

39. Recursive-descent call & consume Saturday, September 12, 2009

40. Predictive yacc/yecc Saturday, September 12, 2009

41. Packrat RD with memo Saturday, September 12, 2009

42. sacriﬁce memory for speed Saturday, September 12, 2009

43. supports PEGs and some CFGs Saturday, September 12, 2009

44. Treetop Pappy neotoma Saturday, September 12, 2009

45. neotoma Behind the CodeTM Saturday, September 12, 2009

46. can:has(cukes) -> false. Saturday, September 12, 2009

47. Cucumber uses Treetop Saturday, September 12, 2009

48. PEG → leex/yecc FAIL Saturday, September 12, 2009

49. parsec → eParSec Saturday, September 12, 2009

50. HOF protocol Saturday, September 12, 2009

51. % Implements "?" PEG operator optional(P) -> fun(Input, Index) -> case P(Input, Index) of {fail, _} -> {[], Input, Index}; {_,_,_} = Success -> Success % {Parsed, RemainingInput, NewIndex} end end. Saturday, September 12, 2009

52. % PEG optional_space <- space?; % Erlang optional_space(Input,Index) -> optional(fun space/2)(Input, Index). Saturday, September 12, 2009

53. Yay! RD! make it memo Saturday, September 12, 2009

54. ets Erlang Term Storage Saturday, September 12, 2009

55. {key, value} Saturday, September 12, 2009

56. key = Index Saturday, September 12, 2009

57. value = dict Saturday, September 12, 2009

58. % Memoization wrapper p(Inp, StartIndex, Name, ParseFun, TransformFun) -> % Grab the memo table from ets Memo = get_memo(StartIndex), % See if the current reduction is memoized case dict:find(Name, Memo) of % If it is, return the result {ok, Result} -> Result; % If not, attempt to parse _ -> case ParseFun(Inp, StartIndex) of % If it fails, memoize the failure {fail,_} = Failure -> memoize(StartIndex, dict:store(Name, Failure, Memo)), Failure; % If it passes, transform and memoize the result. {Result, InpRem, NewIndex} -> Transformed = TransformFun(Result, StartIndex), memoize(StartIndex, dict:store(Name, {Transformed, InpRem, NewIndex}, Memo)), {Transformed, InpRem, NewIndex} end end. Saturday, September 12, 2009

59. parse_transform Saturday, September 12, 2009

60. alternative(Input, Index) -> peg:p(Input, Index, alternative, fun(I,P) -> peg:choose([fun sequence/2, fun primary/2])(I,P) end). rule(alternative) -> peg:choose([fun sequence/2, fun primary/2]); Saturday, September 12, 2009

61. rules <- space? declaration_sequence space?; declaration_sequence <- head:declaration tail:(space declaration)*; declaration <- nonterminal space '<-' space parsing_expression space? ';'; parsing_expression <- choice / sequence / primary; choice <- head:alternative tail:(space '/' space alternative)+; alternative <- sequence / primary; primary <- prefix atomic / atomic suffix / atomic; sequence <- head:labeled_sequence_primary tail:(space labeled_sequence_primary)+; labeled_sequence_primary <- label? primary; label <- alpha_char alphanumeric_char* ':'; suffix <- repetition_suffix / optional_suffix; optional_suffix <- '?'; repetition_suffix <- '+' / '*'; prefix <- '&' / '!'; atomic <- terminal / nonterminal / parenthesized_expression; parenthesized_expression <- '(' space? parsing_expression space? ')'; nonterminal <- alpha_char alphanumeric_char*; terminal <- quoted_string / character_class / anything_symbol; quoted_string <- single_quoted_string / double_quoted_string; double_quoted_string <- '"' string:(!'"' ("" / '"' / .))* '"'; single_quoted_string <- "'" string:(!"'" ("" / "'" / .))* "'"; character_class <- '[' characters:(!']' ('' . / !'' .))+ '] anything_symbol <- '.'; alpha_char <- [a-z_]; alphanumeric_char <- alpha_char / [0-9]; space <- (white / comment_to_eol)+; comment_to_eol <- '%' (!"n" .)*; white <- [ tnr]; Saturday, September 12, 2009

62. self-hosting Saturday, September 12, 2009

63. Future directions Saturday, September 12, 2009

64. self-contained parsers Saturday, September 12, 2009

65. inline code in PEG Saturday, September 12, 2009

66. Reia retem sedate Saturday, September 12, 2009

67. questions? Saturday, September 12, 2009

Of Rats And Dragons

Empfohlen

Empfohlen

Weitere ähnliche Inhalte

Andere mochten auch

Andere mochten auch (16)

Ähnlich wie Of Rats And Dragons

Ähnlich wie Of Rats And Dragons (20)

Mehr von Sean Cribbs

Mehr von Sean Cribbs (19)

Kürzlich hochgeladen

Kürzlich hochgeladen (20)

Of Rats And Dragons